✦ LIBER ✦

Local Search Algorithms for SAT: An Empirical Evaluation

✍ Scribed by Holger H. Hoos; Thomas Stützle

Book ID: 110234522
Publisher: Springer Netherlands
Year: 2000
Tongue: English
Weight: 494 KB
Volume: 24
Category: Article
ISSN: 0168-7433
DOI: 10.1023/a:1006350622830

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved deterministic local search a

An improved deterministic local search algorithm for 3-SAT

✍ Tobias Brueggemann; Walter Kern 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 222 KB

SAT Local Search Algorithms: Worst-Case

SAT Local Search Algorithms: Worst-Case Study

✍ Edward A. Hirsch 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 113 KB

Towards a characterisation of the behavi

Towards a characterisation of the behaviour of stochastic local search algorithms for SAT

✍ Holger H. Hoos; Thomas Stützle 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behaviour of these algorithms is characterised by a random variable. The detailed knowledge of the run-time distribution provi

Guided Local Search for Solving SAT and

Guided Local Search for Solving SAT and Weighted MAX-SAT Problems

✍ Patrick Mills; Edward Tsang 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 89 KB

Scatter Search and Genetic Algorithms fo

Scatter Search and Genetic Algorithms for MAX-SAT Problems

✍ Dalila Boughaci; Belaïd Benhamou; Habiba Drias 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 378 KB

The parameterized complexity of -flip lo

The parameterized complexity of -flip local search for SAT and MAX SAT

✍ Stefan Szeider 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 225 KB