✦ LIBER ✦

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

✍ Scribed by Stefan Szeider

Book ID: 108114397
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 225 KB
Volume: 8
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2010.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Efficient 2 and 3-Flip Neighborhood Sear

Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation

✍ M. Yagiura; T. Ibaraki 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 155 KB

Analyses on the 2 and 3-Flip Neighborhoo

Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT

✍ M. Yagiura; T. Ibaraki 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 110 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

Parameterized Complexity and Local Searc

Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties

✍ Dániel Marx; Ildikó Schlotter 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 740 KB