✦ LIBER ✦

SAT Local Search Algorithms: Worst-Case Study

✍ Scribed by Edward A. Hirsch

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local Search Algorithms for SAT: An Empi

Local Search Algorithms for SAT: An Empirical Evaluation

✍ Holger H. Hoos; Thomas Stützle 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 494 KB

Worst-case behavior of string-searching

Worst-case behavior of string-searching algorithms

✍ Zsolt Tuza 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 649 KB

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

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

Worst-case analysis of local search heur

Worst-case analysis of local search heuristics for the one-machine total tardiness problem

✍ Shiwei Chang; Hirofumi Matsuo; Guochun Tang 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Do search and selection operators play i

Do search and selection operators play important roles in Multi-objective Evolutionary Algorithms: A case study

✍ Yan Zhen-yu; Kang Li-shan; Lin Guang-ming; He Mei 📂 Article 📅 2003 🏛 Wuhan University 🌐 English ⚖ 712 KB