A Theoretical Evaluation of Selected Backtracking Algorithms (1997)

by Grzegorz Kondrak , Peter Van Beek
Venue:Artificial Intelligence
Citations:105 - 2 self

Documents Related by Co-Citation

311 Hybrid Algorithms for the Constraint Satisfaction Problem – Patrick Prosser - 1993
412 Increasing Tree Search Efficiency for Constraint Satisfaction Problems – R M Haralick, G L Elliot - 1980
918 Consistency in networks of relations – Alan Mackworth - 1977
121 Constraint Satisfaction Algorithms – B A Nadel - 1989
501 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
719 Adaptive Constraint Satisfaction – J. E. Borrett, E. P. K. Tsang, N. R. Walsh - 1996
179 Contradicting Conventional Wisdom in Constraint Satisfaction – Daniel Sabin, Eugene C. Freuder - 1994
360 Network-based heuristics for constraint satisfaction problems – R Dechter, J Pearl - 1987
375 Networks of constraints: Fundamental properties and applications to picture processing – U Montanari - 1974
74 Backtrack programming – S W Golomb, L D Baumert - 1965
157 Performance Measurement and Analysis of Certain Search Algorithms – J Gaschnig - 1979
67 Experimental case studies of backtrack vs. waltz-type vs. new algorithms for satisfying assignment problems – J Gaschnig - 1978
244 Constraint satisfaction – A K Mackworth - 1987
250 Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition – R Dechter - 1990
230 Tree clustering for constraint networks – R Dechter, J Pearl - 1989
323 GSAT and Dynamic Backtracking – Matthew L. Ginsberg, David A. McAllester - 1994
837 Constraint Networks – Rina Dechter - 1992
34 Experimental evaluation of preprocessing algorithms for constraint satisfaction problems – R Dechter, I Meiri - 1994
228 Synthesizing constraint expressions – E Freuder - 1978