210 search results - page 8 / 42 » Universal Booleanization of Constraint Models |
SAT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
IPPS
2007
IEEE
14 years 4 months ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
ENTCS
2010
13 years 7 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
ICFEM
2004
Springer
14 years 3 months ago
2004
Springer
Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking. In this context Boolean programs are commonly employed as si...