Results 1  10
of
26,279
Takeover Times on ScaleFree Topologies
, 2007
"... The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of interindividual interactions affects the rate of dissemination of advantageous genetic information and thus affects selective pressure. In this study, we invest ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
investigate the selective pressures induced by several scalefree population structures using takeover time analysis. Previous results have shown that the selective pressures induced by scalefree interaction topologies are at least as strong as those induced by random and panmictic interaction topologies
Takeover Times on ScaleFree Topologies
, 2007
"... The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of interindividual interactions affects the rate of dissemination of advantageous genetic information and thus affects selective pressure. In this study, we invest ..."
Abstract
 Add to MetaCart
investigate the selective pressures induced by several scalefree population structures using takeover time analysis. Previous results have shown that the selective pressures induced by scalefree interaction topologies are at least as strong as those induced by random and panmictic interaction topologies
Takeover times and probabilities of nongenerational selection rules
 in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000
, 2000
"... 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 is often used to assess the behavior of selec ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
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 is often used to assess the behavior
Takeover Times and Probabilities of NonGenerational Selection Rules
, 2000
"... 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 is often used to assess the behavior of selec ..."
Abstract
 Add to MetaCart
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 is often used to assess the behavior
Takeover Times and Probabilities of NonGenerational Selection Rules
"... 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 is often used to assess the behavior of selec ..."
Abstract
 Add to MetaCart
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 is often used to assess the behavior
On Takeover Times in Spatially Structured Populations: Array and Ring
 PROCEEDINGS OF THE SECOND ASIAPACIFIC CONFERENCE ON GENETIC ALGORITHMS AND APPLICATIONS
, 2000
"... 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 `se ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
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
Migration Policies and Takeover Times in Parallel Genetic Algorithms
, 1999
"... This paper investigates how the choices of migrants and replacements affect the takeover time in a parallel genetic algorithm with multiple populations. The analysis is independent of the number of populations or the topology of communications. Migration is assumed to occur every generation, and the ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
This paper investigates how the choices of migrants and replacements affect the takeover time in a parallel genetic algorithm with multiple populations. The analysis is independent of the number of populations or the topology of communications. Migration is assumed to occur every generation
Growth Curves and Takeover Time in Distributed Evolutionary Algorithms
 Genetic and Evolutionary Computation Conference (GECCO2004), volume 3102 of Lecture Notes in Computer Science
, 2004
"... Abstract. This paper presents a study of different models for the growth curves and takeover time in a distributed EA (dEA). The calculation of the takeover time and the dynamical growth curves is a common analytical approach to measure the selection pressure of an EA. This work is a first step to ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. This paper presents a study of different models for the growth curves and takeover time in a distributed EA (dEA). The calculation of the takeover time and the dynamical growth curves is a common analytical approach to measure the selection pressure of an EA. This work is a first step
gedruckt. TAKEOVER TIME IN PARALLEL POPULATIONS WITH MIGRATION
, 1433
"... The 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 ind ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The 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
ABSTRACT Takeover Times on ScaleFree Topologies
"... The topological properties of a network directly impact the flow of information through a system. In evolving populations, the topology of interindividual interactions affects the rate of dissemination of advantageous genetic information and thus affects selective pressure. In this study, we invest ..."
Abstract
 Add to MetaCart
investigate the selective pressures induced by several scalefree population structures using takeover time analysis. Previous results have shown that the selective pressures induced by scalefree interaction topologies are at least as strong as those induced by random and panmictic interaction topologies
Results 1  10
of
26,279