16 search results - page 2 / 4 » MFSAT: A SAT Solver Using Multi-Flip Local Search |
JSAT
2008
13 years 5 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
AAAI
2004
13 years 7 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...
SAT
2004
Springer
13 years 11 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
SAT
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
AAAI
2010
13 years 7 months ago
2010
The AI community has achieved great success in designing high-performance algorithms for hard combinatorial problems, given both considerable domain knowledge and considerable eff...