882 search results - page 3 / 177 » Local Search for Very Large SAT Problems |
JSAT
2010
13 years 2 months ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
CSR
2010
Springer
14 years 5 days ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
AI
2003
Springer
14 years 18 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...
EDBT
2002
ACM
14 years 7 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
CEC
2009
IEEE
14 years 2 days ago
2009
IEEE
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...