894 search results - page 143 / 179 » Parameter-less evolutionary search |
110
click to vote
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
CEC
2010
IEEE
15 years 28 days ago
2010
IEEE
Abstract-- Cancer treatment by chemotherapy involves multiple applications of toxic drugs over a period of time. Optimising the schedule of these treatments can improve the outcome...
GECCO
2008
Springer
15 years 27 days ago
2008
Springer
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
122
click to vote
GECCO
2011
Springer
14 years 3 months ago
2011
Springer
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...