428 search results - page 1 / 86 » FPGA-Based SAT Solver |
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,...
SAT
2004
Springer
13 years 10 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
Due to the widespread demands for efficient SAT solvers in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. We pr...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
SAT
2005
Springer
13 years 10 months ago
2005
Springer
