On Takeover Times in Spatially Structured Populations : Array and Ring

dc.contributor.author	Rudolph, Günter	de
dc.date.accessioned	2004-12-07T08:20:11Z
dc.date.available	2004-12-07T08:20:11Z
dc.date.created	1999	de
dc.date.issued	2001-10-16	de
dc.description.abstract	The 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 may be used to assess and compare the selection pressures of selection methods used in evolutionary algorithms. Here, the notion is generalized from spatially unstructured to structured populations. Lower bounds are derived for arbitrary connected neighborhood structures, lower and upper bounds for array-like structures, and an exact closed form expression if the neighborhood structure is a ring.	en
dc.format.extent	64505 bytes
dc.format.extent	77291 bytes
dc.format.mimetype	application/pdf
dc.format.mimetype	application/postscript
dc.identifier.uri	http://hdl.handle.net/2003/5379
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-15056
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.relation.ispartofseries	Reihe Computational Intelligence ; 74	de
dc.subject.ddc	004	de
dc.title	On Takeover Times in Spatially Structured Populations : Array and Ring	en
dc.type	Text	de
dc.type.publicationtype	report
dcterms.accessRights	open access

Files

Now showing 1 - 2 of 2