|
412
|
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
– R M Haralick, G L Elliot
- 1980
|
|
501
|
Where the really hard problems are
– Peter Cheeseman, Bob Kanefsky, William M. Taylor
- 1991
|
|
323
|
GSAT and Dynamic Backtracking
– Matthew L. Ginsberg, David A. McAllester
- 1994
|
|
250
|
Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition
– R Dechter
- 1990
|
|
157
|
Performance Measurement and Analysis of Certain Search Algorithms
– J Gaschnig
- 1979
|
|
360
|
Network-based heuristics for constraint satisfaction problems
– R Dechter, J Pearl
- 1987
|
|
356
|
Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems
– Steven Minton, Andy Philips, Mark D. Johnston, Philip Laird
- 1993
|
|
919
|
Consistency in networks of relations
– A K Mackworth
- 1977
|
|
76
|
Search rearrangement backtracking and polynomial average time
– P W Purdom
- 1983
|
|
837
|
Constraint Networks
– Rina Dechter
- 1992
|
|
51
|
A comparison of ATMS and CSP techniques
– J de Kleer
- 1989
|
|
29
|
Solving combinatorial search problems by intelligent backtracking
– M Bruynooghe
- 1981
|
|
49
|
A general backtrack algorithm that eliminates most redundant tests
– John Gaschnig
- 1977
|
|
266
|
and Easy Distributions for SAT Problems
– Hard
- 1992
|
|
74
|
Backtrack programming
– S W Golomb, L D Baumert
- 1965
|
|
719
|
Adaptive Constraint Satisfaction
– J. E. Borrett, E. P. K. Tsang, N. R. Walsh
- 1996
|
|
105
|
An empirical study of phase transitions in binary constraint satisfaction problems
– P Prosser
- 1996
|
|
70
|
Exploiting the deep structure of constraint problems
– Colin Williams, Tad Hogg
- 1994
|
|
275
|
A filtering algorithm for constraints of difference in CSPs
– J-C Régin
- 1994
|
