Failure analysis in backtrack search for constraint satisfaction

Authors:
Tudor Hulubei;Barry O'Sullivan
Affiliations:
Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Ireland
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 3
Cited 0

Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
Statistical Regimes Across Constrainedness Regions

Constraints
The Impact of Search Heuristics on Heavy-Tailed Behaviour

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Search effort is typically measured in terms of the number of backtracks, constraint checks, or nodes in the search tree, but measures such as the number of incorrect decisions have also been proposed. Comparisons based on mean and median effort are common. However, other researchers focus on studying runtime distributions, where one can observe a (non-)heavy-tailed distribution under certain conditions [2, 3].