Sciweavers

2457 search results - page 13 / 492
» Local Search with Bootstrapping
Sort
View
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
13 years 11 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
14 years 23 days ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
EVOW
2009
Springer
14 years 2 months ago
A Critical Element-Guided Perturbation Strategy for Iterated Local Search
In this paper, we study the perturbation operator of Iterated Local Search. To guide more efficiently the search to move towards new promising regions of the search space, we intro...
Zhipeng Lü, Jin-Kao Hao
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
14 years 23 days ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
LPAR
2005
Springer
14 years 27 days ago
Another Complete Local Search Method for SAT
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...
Haiou Shen, Hantao Zhang