Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFriedrich, T.en
dc.contributor.authorHebbinghaus, N.en
dc.contributor.authorNeumann, F.en
dc.identifier.citationGECCO 2007 : Genetic and Evolutionary Computation Conference, July 7-11, 2007 University College London, London, UK / Dirk Thierens, et al. (eds.), pp. 1219-1225en
dc.description.abstractIt is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no rigorous analysis pointing out the use of different mechanisms with respect to the runtime behavior. We consider evolutionary algorithms that differ from each other in the way they ensure diversity and point out situations where the right mechanism is crucial for the success of the algorithm. The algorithms considered either diversify the population with respect to the search points or with respect to function values. Investigating simple plateau functions, we show that using the "right" diversity strategy makes the difference between an exponential and a polynomial runtime.en
dc.description.statementofresponsibilityTobias Friedrich, Nils Hebbinghaus, Frank Neumannen
dc.publisherACM New Yorken
dc.rightsCopyright 2007 ACMen
dc.subjectDiversity; Runtime Analysis; Selection Proceduresen
dc.titleRigorous Analyses of Simple Diversity Mechanismsen
dc.typeConference paperen
dc.contributor.conferenceGenetic and Evolutionary Computation Conference (9th : 2007 : London, England)en
dc.publisher.placeNew Yorken
pubs.library.collectionComputer Science publicationsen
dc.identifier.orcidNeumann, F. [0000-0002-2721-3618]en
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.