92 search results - page 13 / 19 » Evolving heuristically difficult instances of combinatorial ... |
189
click to vote
CONSTRAINTS
2010
15 years 6 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...
184
click to vote
FMCAD
2007
Springer
15 years 10 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 ...
160
click to vote
EVOW
2010
Springer
15 years 11 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...
176
click to vote
GECCO
2007
Springer
16 years 20 days 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...
147
click to vote
IWANN
2001
Springer
15 years 11 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...