610 search results - page 51 / 122 » Using SAT in QBF |
AB
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A network of reactions is a commonly used paradigm for representing knowledge about a biological process. How does one understand such generic networks and answer queries...
JSAT
2006
13 years 7 months ago
2006
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
ETS
2010
IEEE
13 years 9 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present a novel approach to acoustic model training for non-audible murmur (NAM) recognition using normal speech data transformed into NAM data. NAM is extremely ...
AAAI
2007
13 years 10 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...