425 search results - page 1 / 85 » General Lower Bounds for the Running Time of Evolutionary Al... |
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
ICALP
2004
Springer
13 years 10 months ago
2004
Springer
RECOMB
2005
Springer
14 years 5 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper addresses the informational asymmetry for constructing an ultrametric evolutionary tree from upper and lower bounds on pairwise distances between n given speci...