Loading...
Please wait, while we are loading the content...
Similar Documents
On Takeover Times in Spatially Structured Populations: Array and Ring
| Content Provider | CiteSeerX |
|---|---|
| Abstract | Abstract. The takeover time is the expected number of iterations of some selec-tion 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 popu-lation. This quantity may be used to assess and compare the ‘selection pressures’ of selection methods used in evolutionary algorithms. Here, the notion is gener-alized 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. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Takeover Time Spatially Structured Population Neighborhood Structure Selection Pressure Selec-tion Method Initial Popu-lation Selection Method Form Expression Expected Number Structured Population Evolutionary Algorithm Upper Bound Array-like Structure |
| Content Type | Text |
| Resource Type | Article |
