Sciweavers

114 search results - page 1 / 23
» Noise Strategies for Improving Local Search
Sort
View
AAAI
1994
13 years 6 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
MEMETIC
2010
311views more  MEMETIC 2010»
12 years 11 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 3 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
CP
2000
Springer
13 years 9 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
AAAI
1997
13 years 6 months ago
Evidence for Invariants in Local Search
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
David A. McAllester, Bart Selman, Henry A. Kautz