428 search results - page 56 / 86 » FPGA-Based SAT Solver |
132
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
123
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
199
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
113
Voted
ASPDAC
2006
ACM
15 years 10 months ago
2006
ACM
Commonly used pattern sources in simulation-based verification include random, guided random, or design verification patterns. Although these patterns may help bring the design ...
134
click to vote
ICTAI
2003
IEEE
15 years 9 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...