The dynamics of dynamic variable ordering heuristics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1520, Issue , 1998, Pages 17-24

  Prosser, Patrick ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY;

DYNAMIC VARIABLE ORDERING; SEARCH PROCESS; SEARCH TREES; STATIC ORDERING;

COMPUTER PROGRAMMING;

EID: 84957717912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_3     Document Type: Conference Paper

References (10)

1. D. Brelaz. New methods to color the vertices of a graph. JACM, 22(4):251-256, 1979.
2. P.A. Geelen. Dual viewpoint heuristics for the binary constraint satisfaction problem. In Proc. ECAI92, pages 31-35, 1992.
3. 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.
4. 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.
5. I.P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proc. AAAI-96, 1996.
6. R.M. Haralick and G.L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
7. T. Hogg, B.A. Huberman, and C.P. Williams. Phase transitions and the search problem (editorial). Artificial Intelligence, 81(1-2):1-15, 1996.
8. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
9. P.W. Purdom. Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21:117-133, 1983.
10. D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint sat- isfaction. In Proc. ECAI-94, pages 125-129, 1994.