A Mixture-Model for the Behaviour of SLS Algorithms for SAT

@inproceedings{Hoos2002AMF,
  title={A Mixture-Model for the Behaviour of SLS Algorithms for SAT},
  author={Holger H. Hoos},
  booktitle={AAAI/IAAI},
  year={2002}
}
Stochastic Local Search (SLS) algorithms are amongst the most effective approaches for solving hard and large propositional satisfiability (SAT) problems. Prominent and successful SLS algorithms for SAT, including many members of the WalkSAT and GSAT families of algorithms, tend to show highly regular behaviour when applied to hard SAT instances: The run-time distributions (RTDs) of these algorithms are closely approximated by exponential distributions. The deeper reasons for this regular… CONTINUE READING
15 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

Similar Papers

Loading similar papers…