5 search results - page 1 / 1 » A practical reconfigurable hardware accelerator for Boolean ... |
DAC
2008
ACM
14 years 5 months ago
2008
ACM
FPL
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. We present different architectures to solve Boolean satisfiability problems in instance-specific hardware. A simulation of these architectures shows that for examples fro...
FPL
2003
Springer
13 years 10 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
13 years 10 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,...
DDECS
2009
IEEE
13 years 11 months ago
2009
IEEE
—Automatic Test Pattern Generation (ATPG) based on Boolean satisfiability (SAT) has been shown to be a beneficial complement to traditional ATPG techniques. Boolean solvers wor...