Abstract
Much progress has been made in terms of boosting the effectiveness of backtrack style search methods. In addition, during the last decade, a much better understanding of problem hardness, typical case complexity, and backtrack search behavior has been obtained. One example of a recent insight into backtrack search concerns so-called heavy-tailed behavior in randomized versions of backtrack search. Such heavy-tails explain the large variations in runtime often observed in practice. However, heavy-tailed behavior does certainly not occur on all instances. This has led to a need for a more precise characterization of when heavy-tailedness does and when it does not occur in backtrack search. In this paper, we provide such a characterization. We identify different statistical regimes of the tail of the runtime distributions of randomized backtrack search methods and show how they are correlated with the “sophistication” of the search procedure combined with the inherent hardness of the instances. We also show that the runtime distribution regime is highly correlated with the distribution of the depth of inconsistent subtrees discovered during the search. In particular, we show that an exponential distribution of the depth of inconsistent subtrees combined with a search space that grows exponentially with the depth of the inconsistent subtrees implies heavy-tailed behavior.
This work was supported in part by the Intelligent Information Systems Institute, Cornell University (AFOSR grant F49620-01-1-0076).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hogg, T., Huberman, B., Williams, C.: Phase Transitions and Search Problems. Artificial Intelligence 81 (1-2), 1–15 (1996)
Gent, I., Walsh, T.: Easy Problems are Sometimes Hard. Artificial Intelligence 70, 335–345 (1994)
Hogg, T., Williams, C.: The Hardest Constraint Problems: a Double Phase Transition. Artificial Intelligence 69, 359–377 (1994)
Smith, B., Grant, S.: Sparse Constraint Graphs and Exceptionally Hard Problems. In: Proceedings IJCAI 1995, Montréal, Canada, pp. 646–651 (1995)
Selman, B., Kirkpatrick, S.: Finite-Size Scaling of the Computational Cost of Systematic Search. Artificial Intelligence 81, 273–295 (1996)
Smith, B., Grant, S.: Modelling Exceptionally Hard Constraint Satisfaction Problems. In: Proceedings CP 1997, Linz, Austria, pp. 182–195 (1997)
Frost, D., Rish, I., Vila, L.: Summarizing CSP Hardness with Continuous Probability Distributions. In: AAAI 1997, Providence RI, pp. 327–333 (1997)
Gomes, C., Selman, B., Crato, N.: Heavy-tailed Distributions in Combinatorial Search. In: Proceedings CP 1997, Linz, Austria, pp. 121–135 (1997)
Hoos, H.: PhD Thesis,TU Darmstadt (1998)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Chen, H., Gomes, C., Selman, B.: Formal Models of Heavy-tailed Behavior in Combinatorial Search. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 408–421. Springer, Heidelberg (2001)
Williams, R., Gomes, C., Selman, B.: Backdoors to Typical Case Complexity (2003)
Walsh, T.: SAT vs CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441–456. Springer, Heidelberg (2000)
Achlioptas, D., Kirousis, L., Kranakis, E., Krizanc, D., Molloy, M., Stamatiou, Y.: Random Constraint Satisfaction: a More Accurate Picture. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 107–120. Springer, Heidelberg (1997)
Xu, K., Li, W.: Exact Phase Transition in Random Constraint Satisfaction Problems. JAIR 12, 93–103 (2000)
Bessière, C., Zanuttini, B., Fernández, C.: Measuring Search Trees. In: Hnich, B. (ed.) Proceedings ECAI 2004 Workshop on Modelling and Solving Problems with Constraints, Valencia, Spain (2004)
Li, C.: Ambulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proceedings IJCAI 1997, Nagoya, Japan, pp. 366–371 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gomes, C.P., Fernández, C., Selman, B., Bessiere, C. (2004). Statistical Regimes Across Constrainedness Regions. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive