428 search results - page 66 / 86 » FPGA-Based SAT Solver |
129
click to vote
ICTAI
2007
IEEE
15 years 8 months ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...
125
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
120
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
116
click to vote
BMCBI
2008
15 years 2 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...
109
click to vote
DAC
2007
ACM
16 years 2 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...