3 search results - page 1 / 1 » A Massively-Parallel Easily-Scalable Satisfiability Solver U... |
DAC
1999
ACM
14 years 3 months ago
1999
ACM
FPL
2003
Springer
14 years 4 months ago
2003
Springer
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
CCECE
2006
IEEE
14 years 5 months ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...