363 search results - page 5 / 73 » The SAT Phase Transition |
AI
2008
Springer
13 years 7 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
CP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
HPCA
2005
IEEE
14 years 7 months ago
2005
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Proposed on-line systems automatically group these similar intervals of execution in...
DNA
2005
Springer
14 years 27 days ago
2005
Springer
An algorithm that could be implemented at a molecular level for solving the satisfiability of Boolean expressions is presented. This algorithm, based on properties of specific se...
IFIP
2001
Springer
13 years 11 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...