Full metadata record
DC FieldValueLanguage
dc.contributor.authorRudolph, Günterde
dc.date.accessioned2004-12-07T08:20:14Z-
dc.date.available2004-12-07T08:20:14Z-
dc.date.created1999de
dc.date.issued2001-10-16de
dc.identifier.urihttp://hdl.handle.net/2003/5382-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-15299-
dc.description.abstractThe takeover time is the expected number of iterations of some selection method until a population consists entirely of copies of the best individual under the assumption that only one best individual is contained in the initial population. This quantity is often used to assess the behavior of selection methods in evolutionary algorithms. Here, takeover times and probabilities are analytically determined for some popular non-generational selection rules. Moreover, a novel classification number that aggregates additional information about the selection method is proposed.en
dc.format.extent144797 bytes-
dc.format.extent249397 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/postscript-
dc.language.isoende
dc.publisherUnversität Dortmundde
dc.relation.ispartofseriesReihe Computational Intelligence ; 78de
dc.subject.ddc004de
dc.titleTakeover Times and Probabilities of Non-Generational Selection Rulesen
dc.typeTextde
dc.type.publicationtypereport-
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
ci78.pdfDNB141.4 kBAdobe PDFView/Open
ci78.ps243.55 kBPostscriptView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org