Abstract
It has long been accepted that dynamic variable ordering heuristics outperform static orderings. But just how dynamic are dynamic variable ordering heuristics? This paper examines the behaviour of a number of heuristics, and attempts to measure the entropy of the search process at different depths in the search tree
This is a preview of subscription content, log in via an institution to check access.
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
D. Brelaz. New methods to color the vertices of a graph. JACM, 22(4):251–256, 1979.
P.A. Geelen. Dual viewpoint heuristics for the binary constraint satisfaction problem. In Proc. ECAI92, pages 31–35, 1992.
I.P. Gent, E. MacIntyre, P. Prosser, B.M. Smith, and T. Walsh. An empirical study of dynamic variable ordering heuristics for constraint satisfaction problems. In Proc. CP96, pages 179–193, 1996.
I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. Scaling effects in the CSP phase transition. In Principles and Practice of Constraint Programming, pages 70–87. Springer, 1995.
I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proc. AAAI-96, 1996.
R.M. Haralick and G.L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
T. Hogg, B.A. Huberman, and C.P. Williams. Phase transitions and the search problem (editorial). Artificial Intelligence, 81(1–2):1–15, 1996.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268–299, 1993.
P.W. Purdom. Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21:117–133, 1983.
D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI-94, pages 125–129, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prosser, P. (1998). The Dynamics of Dynamic Variable Ordering Heuristics. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive