26 search results - page 1 / 6 » An Efficient Sequential SAT Solver With Improved Search Stra... |
42
Voted
DATE
2005
IEEE
15 years 5 months ago
2005
IEEE
94
Voted
DAC
2001
ACM
16 years 19 days ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
96
Voted
AISC
2008
Springer
15 years 1 months ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
136
click to vote
AI
2005
Springer
14 years 11 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
In this paper, we present a novel all-solutions preimage SAT solver, SOLALL, with the following features: (1) a new success-driven learning algorithm employing smaller cut sets; (...