Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems

DOI10.1007/978-3-642-13182-0_34zbMATH Open1285.68165OpenAlexW1516554206MaRDI QIDQ3569759

Uwe Schöning

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_34

zbMATH Keywords

CSPconstraint satisfaction problemstochastic local searchSATLovász local lemmasatisfiability algorithmSLS

Mathematics Subject Classification ID

Stochastic programming (90C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Title not available (Why is that?) 👍 👎
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings 👍 👎
• Modelling the dynamics of stochastic local search on \(k\)-SAT 👍 👎
• Local search algorithms for SAT: an empirical evaluation 👍 👎
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT 👍 👎
• Local search algorithms for SAT: an empirical evaluation 👍 👎
• Improving Stochastic Local Search for SAT with a New Probability Distribution 👍 👎
• On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem 👍 👎

This page was built for publication: Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569759)