Full metadata record
DC FieldValueLanguage
dc.contributor.authorDroste, Stefande
dc.contributor.authorJansen, Thomasde
dc.contributor.authorWegener, Ingode
dc.date.accessioned2004-12-07T08:19:30Z-
dc.date.available2004-12-07T08:19:30Z-
dc.date.created1998de
dc.date.issued1998-11-08de
dc.identifier.urihttp://hdl.handle.net/2003/5340-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-8024-
dc.description.abstractMany experimental results are reported on all types of Evolutionary Algorithms but only few results have been proved. A step towards a theory on Evolutionary Algorithms, in particular, the socalled (1+1) Evolutionary Algorithm is performed. Linear functions are proved to be optimized in expected time O(n ln n) but only mutation rates of size O (1=n) can ensure this behaviour. For some polynomial of degree 2 the optimization needs exponential time. The same is proved for a unimodal function. Both results were not expected by several other authors. Finally, a hierarchy result is proved. Moreover, methods are presented to analyze the behaviour of the (1 + 1) Evolutionary Algorithm.en
dc.format.extent370997 bytes-
dc.format.extent924563 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/postscript-
dc.language.isoende
dc.publisherUniversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 21de
dc.subject.ddc004de
dc.titleOn the Analysis of the (1 + 1) Evolutionary Algorithmen
dc.typeTextde
dc.type.publicationtypereport-
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
CI2198_doc.ps902.89 kBPostscriptView/Open
ci2198_doc.pdfDNB362.3 kBAdobe PDFView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org