Full metadata record
DC FieldValueLanguage
dc.contributor.authorJägersküpper, Jensde
dc.date.accessioned2004-12-07T08:21:12Z-
dc.date.available2004-12-07T08:21:12Z-
dc.date.issued2003-06-04de
dc.identifier.urihttp://hdl.handle.net/2003/5426-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-7840-
dc.description.abstractAlthough evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on expected runtimes and success probabilities are limited to discrete search spaces. In practice, however, EAs are mostly used for continuous optimization problems. First results on the expected runtime of a simple, but fundamental EA minimizing a symmetric polynomial of degree two in Rn are presented. Namely, the so-called (1+1) evolution strategy ((1+1) ES) minimizing the SPHERE function is investigated. A lower bound on the expected runtime is shown that is valid for any mde
dc.format.extent503247 bytes-
dc.format.extent750152 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/postscript-
dc.language.isoende
dc.publisherUniversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 140de
dc.subject.ddc000de
dc.titleAnalysis of a Simple Evolutionary Algorithm for the Minimization in Euclidian Spacesen
dc.typeTextde
dc.type.publicationtypereport-
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
140.pdfDNB732.57 kBAdobe PDFView/Open
140.ps491.45 kBPostscriptView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org