79 search results - page 4 / 16 » Strategies for Solving SAT in Grids by Randomized Search |
AAAI
1997
13 years 11 months ago
1997
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
CPAIOR
2010
Springer
13 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
JSAT
2008
13 years 9 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 ...
DAC
2005
ACM
14 years 10 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
SAT
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...