3 search results - page 1 / 1 » Switching among Non-Weighting, Clause Weighting, and Variabl... |
CP
2008
Springer
13 years 6 months ago
2008
Springer
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
JSAT
2008
13 years 4 months ago
2008
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...