Local Search and Backtracking vs Non-Systematic Backtracking

@inproceedings{Prestwich2001LocalSA,
  title={Local Search and Backtracking vs Non-Systematic Backtracking},
  author={Steven David Prestwich},
  year={2001}
}
This paper addresses the following question: what is the essential difference between stochastic local search (LS) and systematic backtracking (BT) that gives LS superior scalability? One possibility is LS’s lack of firm commitment to any variable assignment. Three BT algorithms are modified to have this feature by introducing randomness into the choice of backtracking variable: a forward checker for n-queens, the DSATUR graph colouring algorithm, and a Davis-Logemann-Loveland procedure for… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 40 references

Nonsystematic Backtracking Search

  • W. D. Harvey
  • Ph.D. diss., Stanford University.
  • 1995
Highly Influential
5 Excerpts

Improvements to Propositional Satisfiability Search Algorithms

  • J. W. Freeman
  • Ph.D. diss., University of Pennsylvania…
  • 1994
Highly Influential
5 Excerpts

Systematic and Nonsystematic Search Strategies

  • P. Langley
  • Proceedings of the First International Conference…
  • 1992
Highly Influential
5 Excerpts

Stochastic Local Search In Constrained Spaces

  • S. D. Prestwich
  • Proceedings of Practical Applications of…
  • 2000
Highly Influential
8 Excerpts

Similar Papers

Loading similar papers…