Towards a characterisation of the behaviour of stochastic local search algorithms for SAT

Towards a characterisation of the behaviour of stochastic local search algorithms for SAT (1999)

Cached

Download Links

[www.cs.ubc.ca]
[www.cs.ubc.ca]
[iridia.ulb.ac.be]

Other Repositories/Bibliography

CiteULike
DBLP

by Holger H. Hoos , Thomas Stützle

Venue:	ARTIFICIAL INTELLIGENCE
Citations:	38 - 14 self

Versions

Version History

Metadata Version 0

Datum	Value	Source
TITLE	Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT	SVM HeaderParse 0.1
AUTHOR NAME	Holger H. Hoos	SVM HeaderParse 0.1
AUTHOR ADDR	FG Intellektik, TU Darmstadt; Alexanderstr. 10, D-64283 Darmstadt, Germany	SVM HeaderParse 0.1
AUTHOR NAME	Thomas St Utzle	SVM HeaderParse 0.1
AUTHOR ADDR	FG Intellektik, TU Darmstadt; Alexanderstr. 10, D-64283 Darmstadt, Germany	SVM HeaderParse 0.1
ABSTRACT	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 provides important information about the behaviour of SLS algorithms. In this paper we investigate the empirical run-time distributions for Walksat, one of the most powerful SLS algorithms for the Propositional Satisfiability Problem (SAT). Using statistical analysis techniques, we show that on hard Random-3-SAT problems, Walksat's run-time behaviour can be characterised by exponential distributions. This characterisation can be generalised to various SLS algorithms for SAT and to encoded problems from other domains. This result also has a number of consequences which are of theoretical as well as practical interest. One of these is the fact that these algorithms can be easily parallelised such that optimal speed-up is achieved for hard problem instances. 1	SVM HeaderParse 0.1
CITATIONS	28 found	ParsCit 1.0