61 search results - page 10 / 13 » A Clause-Based Heuristic for SAT Solvers |
163
click to vote
IPPS
2009
IEEE
16 years 20 days ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
143
click to vote
AAAI
2004
15 years 7 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
136
click to vote
ASPDAC
2006
ACM
15 years 12 months ago
2006
ACM
Commonly used pattern sources in simulation-based verification include random, guided random, or design verification patterns. Although these patterns may help bring the design ...
153
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
162
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...