73 search results - page 9 / 15 » The SAT 2005 Solver Competition on Random Instances |
AAAI
2008
13 years 9 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
CP
2003
Springer
14 years 21 days ago
2003
Springer
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
CP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
SAT
2007
Springer
14 years 1 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...
AAAI
2008
13 years 9 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...