3 search results - page 1 / 1 » A Massively-Parallel Easily-Scalable Satisfiability Solver U... |
138
Voted
DAC
1999
ACM
15 years 11 months ago
1999
ACM
164
Voted
FPL
2003
Springer
15 years 12 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...
188
Voted
CCECE
2006
IEEE
16 years 24 days 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,...