Hybrid Algorithms for the Constraint Satisfaction Problem (1993)

Cached

Download Links

by Patrick Prosser
Venue:Computational Intelligence
Citations:346 - 7 self

Documents Related by Co-Citation

462 Increasing tree search efficiency for constraint satisfaction problems – Robert M Haralick, Gordon L Elliott - 1980
360 GSAT and Dynamic Backtracking – Matthew L. Ginsberg, David A. McAllester - 1994
576 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
274 Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition – Rina Dechter - 1990
175 Performance Measurement and Analysis of Certain Search Algorithms – J Gaschnig - 1979
397 Network-based heuristics for constraint satisfaction problems – R Dechter, J Pearl - 1987
398 Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems – Steven Minton, Andy Philips, Mark D. Johnston, Philip Laird - 1993
80 Search rearrangement backtracking and polynomial average time – P W Purdom - 1983
948 Constraint Networks – Rina Dechter - 1992
57 A comparison of ATMS and CSP techniques – J de Kleer - 1989
32 Solving combinatorial search problems by intelligent backtracking – M Bruynooghe - 1981
1000 Consistency in networks of relations – A K Mackworth - 1977
283 and easy distributions of sat problems – Hard - 1992
90 Backtrack programming – S W GOLOMB, L D BAUMERT - 1965
114 An empirical study of phase transitions in binary constraint satisfaction problems – P Prosser - 1996
73 Exploiting the deep structure of constraint problems – Colin Williams, Tad Hogg - 1994
619 A Truth Maintenance System – J Doyle - 1979
328 A filtering algorithm for constraints of difference in CSPs – J C RĂ©gin - 1994
202 Experimental Results on the Crossover Point in Satisfiability Problems – James M. Crawford, Larry D. Auton - 1993