92 search results - page 1 / 19 » Evolving heuristically difficult instances of combinatorial ... |
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...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
PDCN
2004
13 years 6 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
AE
2007
Springer
13 years 11 months ago
2007
Springer
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific su...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Transgenetic algorithms are evolutionary computing techniques based on living processes where cooperation is the main evolutionary strategy. Those processes contain the movement o...