On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
| dc.contributor.author | Wegener, Ingo | de |
| dc.contributor.author | Witt, Carsten | de |
| dc.date.accessioned | 2004-12-07T08:21:10Z | |
| dc.date.available | 2004-12-07T08:21:10Z | |
| dc.date.created | 2002 | de |
| dc.date.issued | 2003-06-04 | de |
| dc.description.abstract | Randomized search heuristics like evolutionary algorithms and simulated annealing find many applications, especially in situations where no full information on the problem instance is available. In order to understand how these heuristics work, it is necessary to analyze their behavior on classes of functions. Such an analysis is performed here for the class of monotone pseudo-boolean polynomials. Results depending on the degree and the number of terms of the polynomial are obtained. The class of monotone polynomials is of special interest since simple functions of this kind can have an image set of exponential size, improvements can increase the Hamming distance to the optimum and in order to find a better search point, it can be necessary to search within a large plateau of search points with the same fitness value. | en |
| dc.format.extent | 220592 bytes | |
| dc.format.extent | 425130 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/2003/5425 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-5641 | |
| dc.language.iso | en | de |
| dc.publisher | Universität Dortmund | de |
| dc.relation.ispartofseries | Reihe Computational Intelligence ; 141 | de |
| dc.subject.ddc | 004 | de |
| dc.title | On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | |
| dcterms.accessRights | open access |