Sciweavers

617 search results - page 47 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 13 days ago
Credit assignment in adaptive memetic algorithms
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...
J. E. Smith
CAAN
2007
Springer
15 years 10 months ago
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
Dirk Richter, Boris Goldengorin, Gerold Jäger...
PPSN
2010
Springer
15 years 4 months ago
First-Improvement vs. Best-Improvement Local Optima Networks of NK Landscapes
Abstract. This paper extends a recently proposed model for combinatorial landscapes: Local Optima Networks (LON), to incorporate a first-improvement (greedyascent) hill-climbing a...
Gabriela Ochoa, Sébastien Vérel, Mar...
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
15 years 6 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
AMAI
2004
Springer
15 years 11 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate