3 search results - page 1 / 1 » Towards a Characterisation of the Behaviour of Stochastic Lo... |
AI
1999
Springer
13 years 4 months ago
1999
Springer
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behav...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Stochastic local search (SLS) methods are underlying some of the best-performing algorithms for certain types of SAT instances, both from an empirical as well as from a theoretical...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...