27 search results - page 2 / 6 » Variable-Selection Heuristics in Local Search for SAT |
AAAI
2006
13 years 7 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, ...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
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...
IJCAI
2003
13 years 7 months ago
2003
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their origina...
ECAI
2008
Springer
13 years 7 months ago
2008
Springer
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
CP
2008
Springer
13 years 7 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...