A novel local search based on variable-focusing for random K-SAT
Artificial Intelligence
2013-12-13 v2 Disordered Systems and Neural Networks
Abstract
We introduce a new local search algorithm for satisfiability problems. Usual approaches focus uniformly on unsatisfied clauses. The new method works by picking uniformly random variables in unsatisfied clauses. A Variable-based Focused Metropolis Search (V-FMS) is then applied to random 3-SAT. We show that it is quite comparable in performance to the clause-based FMS. Consequences for algorithmic design are discussed.
Cite
@article{arxiv.1311.2914,
title = {A novel local search based on variable-focusing for random K-SAT},
author = {Rémi Lemoy and Mikko Alava and Erik Aurell},
journal= {arXiv preprint arXiv:1311.2914},
year = {2013}
}
Comments
7 pages, 3 figures