29 search results - page 5 / 6 » Optimizing exact genetic linkage computations |
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
SOCO
2010
Springer
12 years 12 months ago
2010
Springer
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...