Full metadata record
DC FieldValueLanguage
dc.contributor.authorRudolph, Günterde
dc.date.accessioned2009-05-12T16:00:26Z-
dc.date.available2009-05-12T16:00:26Z-
dc.date.issued2006-05de
dc.identifier.urihttp://hdl.handle.net/2003/26114-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-699-
dc.description.abstractThe term takeover time regarding selection methods used in evolutionary algorithms denotes the (expected) number of iterations of the selection method until the entire population consists of copies of the best individual, provided that the initial population consists of a single copy of the best individual whereas the remaining individuals are worse. Here, this notion is extended to parallel subpopulations that exchange individuals according to some migration paths modelled by a directed graph. We develop upper bounds for migrations path along uni- and bidirectial rings as well as arbitrary connected graphs where each vertex is reachable from every other vertex.en
dc.language.isoende
dc.relation.ispartofseriesReihe CI; 206-06de
dc.subjectmigration modelen
dc.subjectspatially structured populationen
dc.subjecttakeover timeen
dc.subject.ddc004de
dc.titleTakeover time in parallel populations with migrationen
dc.typeTextde
dc.type.publicationtypereportde
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 531

Files in This Item:
File Description SizeFormat 
20606.pdfDNB177.42 kBAdobe PDFView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org