2174 search results - page 268 / 435 » On the Brittleness of Evolutionary Algorithms |
195
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
Novelty search is a recently proposed method for evolutionary computation designed to avoid the problem of deception, in which the fitness function guides the search process away...
349
click to vote
IWSOS
2011
Springer
14 years 9 months ago
2011
Springer
Abstract This paper depicts and evaluates an evolutionary design process for generating a complex self-organizing multicellular system based on Cellular Automata (CA). We extend th...
163
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA, RNA or protein sequences while minimizing the number of evolutionary changes. Much work has been ...
155
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
171
click to vote
IPPS
2006
IEEE
16 years 15 days ago
2006
IEEE
This paper describes a parallel implementation of our recently developed algorithm for phylogenetic analysis on the IBM BlueGene/L cluster [15]. This algorithm constructs evolutio...