101 search results - page 15 / 21 » A Case for Simple SAT Solvers |
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
CP
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
AI
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...