Sciweavers

Share
CSR
2010
Springer

Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems

9 years 4 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
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). One is the algorithm used in Moser’s ingenious proof of a constructive version of Lov´asz Local Lemma [3], the other is the k-SAT random walk algorithm from [5, 6], generalized to CSP’s. There are several similarities, both algorithms use a version of stochastic local search (SLS), but the kind of local search neighborhood is defined differently, also the preconditions for the algorithms to work (efficiently) are quite different.
Uwe Schöning
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where CSR
Authors Uwe Schöning
Comments (0)
books