313 search results - page 1 / 63 » Complete Local Search with Memory |
HEURISTICS
2002
13 years 4 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
AAAI
2006
13 years 5 months ago
2006
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
AAAI
2004
13 years 6 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
AMAI
1998
Springer
13 years 4 months ago
1998
Springer
