422 search results - page 25 / 85 » Multithreaded SAT Solving |
152
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
189
click to vote
AI
2005
Springer
15 years 5 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...
154
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT p...
109
Voted
FPL
2004
Springer
15 years 10 months ago
2004
Springer
The paper describes two methods for the design of matrix-oriented SAT solvers based on data compression. The first one provides matrix compression in a host computer and decompress...
118
click to vote
NIPS
2004
15 years 6 months ago
2004
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...