On the Analysis of Evolutionary Algorithms
dc.contributor.author | Jansen, Thomas | de |
dc.contributor.author | Wegener, Ingo | de |
dc.date.accessioned | 2004-12-07T08:19:52Z | |
dc.date.available | 2004-12-07T08:19:52Z | |
dc.date.created | 1998 | de |
dc.date.issued | 2001-10-16 | de |
dc.description.abstract | There is a lot of experimental evidence that crossover is, for some functions, an essential operator of evolutionary algorithms. Nevertheless, it was an open problem to prove for some function that an evolutionary algorithm using crossover is essentially more efficient than evolutionary algorithms without crossover. In this paper, such an example is presented and its properties are proved. | en |
dc.format.extent | 192231 bytes | |
dc.format.extent | 201048 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.uri | http://hdl.handle.net/2003/5361 | |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15054 | |
dc.language.iso | en | de |
dc.publisher | Universität Dortmund | de |
dc.relation.ispartofseries | Reihe Computational Intelligence ; 51 | de |
dc.subject.ddc | 004 | de |
dc.title | On the Analysis of Evolutionary Algorithms | en |
dc.type | Text | de |
dc.type.publicationtype | report | |
dcterms.accessRights | open access |