92 search results - page 13 / 19 » Evolving heuristically difficult instances of combinatorial ... |
102
click to vote
CONSTRAINTS
2010
14 years 9 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
FMCAD
2007
Springer
15 years 1 months ago
2007
Springer
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
EVOW
2010
Springer
15 years 2 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
66
Voted
IWANN
2001
Springer
15 years 1 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...