26 search results - page 1 / 6 » Partitioning SAT Instances for Distributed Solving |
69
Voted
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
88
Voted
AISC
2008
Springer
15 years 9 days ago
2008
Springer
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
SC
2003
ACM
15 years 3 months ago
2003
ACM
We present GridSAT, a parallel and complete satisfiability solver designed to solve non-trivial SAT problem instances using a large number of widely distributed and heterogeneous...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
CP
2004
Springer
15 years 3 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...