Full metadata record
DC FieldValueLanguage
dc.contributor.authorWegener, Ingode
dc.date.accessioned2004-12-07T08:20:41Z-
dc.date.available2004-12-07T08:20:41Z-
dc.date.created2000de
dc.date.issued2001-10-17de
dc.identifier.urihttp://hdl.handle.net/2003/5402-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-15272-
dc.description.abstractMany experiments ave shown that evolutionary algorithms are useful randomized search heuristics for optimization problems. In order to learn more about the reasons for their efficiency and in order to obtain proven results on evolutionary algorithms it is necessary to develop a theory of evolutionary algorithms. Such a theory is still in its infancy. A major part of a theory is the analysis of different variants of evolutionary algorithms on selected functions. Several results of this kind have been obtained during the last years. Here important analytical tools are presented, discussed, and applied to well-chosen example functions.en
dc.format.extent183567 bytes-
dc.format.extent367790 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/postscript-
dc.language.isoende
dc.publisherUniversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 99de
dc.subject.ddc004de
dc.titleMethods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functionsen
dc.typeTextde
dc.type.publicationtypereport-
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
ci99.pdfDNB179.26 kBAdobe PDFView/Open
ci99.ps359.17 kBPostscriptView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org