This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown or had only anecdotal evidence. Specifically, we study hard random 3-CNF formulas and provide surprisingly simple analytical fits for the optimal (static) noise level and the runtime at optimal noise, as a function of the clause-to-variable ratio. We also demonstrate, for the first time for local search, a power-law decay in the tail of the runtime distribution in the low noise regime. Finally, we discuss a Markov Chain model capturing this intriguing feature. © 2010 Springer-Verlag.
CITATION STYLE
Kroc, L., Sabharwal, A., & Selman, B. (2010). An empirical study of optimal noise and runtime distributions in local search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6175 LNCS, pp. 346–351). https://doi.org/10.1007/978-3-642-14186-7_31
Mendeley helps you to discover research relevant for your work.