27 search results - page 5 / 6 » Visualizing SAT Instances and Runs of the DPLL Algorithm |
CP
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
CVPR
2010
IEEE
14 years 5 months ago
2010
IEEE
A recent dominating trend in tracking called tracking-by-detection uses on-line classifiers in order to redetect objects over succeeding frames. Although these methods usually deli...
IJCAI
2007
13 years 11 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...