482 search results - page 2 / 97 » A Probabilistic Algorithm for k-SAT and Constraint Satisfact... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
NIPS
2007
13 years 6 months ago
2007
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
IGPL
2006
13 years 5 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...