On the Analysis of Evolutionary Algorithms

dc.contributor.authorJansen, Thomasde
dc.contributor.authorWegener, Ingode
dc.date.accessioned2004-12-07T08:19:52Z
dc.date.available2004-12-07T08:19:52Z
dc.date.created1998de
dc.date.issued2001-10-16de
dc.description.abstractThere 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.extent192231 bytes
dc.format.extent201048 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/2003/5361
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-15054
dc.language.isoende
dc.publisherUniversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 51de
dc.subject.ddc004de
dc.titleOn the Analysis of Evolutionary Algorithmsen
dc.typeTextde
dc.type.publicationtypereport
dcterms.accessRightsopen access

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
ci51.pdf
Size:
196.34 KB
Format:
Adobe Portable Document Format
Description:
DNB
No Thumbnail Available
Name:
ci51.ps
Size:
187.73 KB
Format:
Postscript Files