A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem (1996)

Cached

Download Links

by Roberto J. Bayardo , Daniel P. Miranker
Venue:In Proceedings of the Thirteenth National Conference on Artificial Intelligence
Citations:77 - 2 self

Active Bibliography

28 Backtracking algorithms for constraint satisfaction problems – Rina Dechter, Daniel Frost - 1999
Backtrack-Bounded Search in Polynomial Space – Roberto Bayardo, Jr., Daniel P. Miranker - 1994
47 Intelligent Backtracking On Constraint Satisfaction Problems: Experimental And Theoretical Results – Andrew B. Baker - 1995
3 Representation and Reasoning with Non-Binary Constraints – Kostas Stergiou - 2001
32 On the space-time trade-off in solving constraint satisfaction problems – Roberto J. Bayardo, Daniel P. Miranker - 1995
A generic bounded backtracking framework for solving CSPs – Samba Ndojh Ndiaye, Cyril Terrioux - 2007
10 Backtracking Search Algorithms – Peter van Beek - 2006
7 A note on CSP graph parameters – T. Schiex - 1999
37 Backjump-based Backtracking for Constraint Satisfaction Problems – Rina Dechter, Daniel Frost - 2002
47 Counting models using connected components – Roberto J. Bayardo, J. D. Pehoushek - 2000
49 Hybrid backtracking bounded by tree-decomposition of constraint networks – philipp jegou, Cyril Terrioux - 2003
368 Algorithms for Constraint Satisfaction Problems: A Survey – Vipin Kumar - 1992
Réseaux De Contraintes – Thomas Schiex - 2000
4 Hard, flexible and dynamic constraint satisfaction – Ian Miguel, Qiang Shen - 1999
23 A Generic Framework for Constraint-Directed Search and Scheduling – J. Christopher Beck, Mark S. Fox - 1998
54 Domain Filtering Consistencies – Romuald Debruyne, Christian Bessière - 2001
19 Dynamic Flexible Constraint Satisfaction and its Application to AI Planning – Ian Miguel - 2001
Constraints, Varieties, and Algorithms – M. R. C. Van Dongen - 2002
50 Resolution versus Search: Two Strategies for SAT – Irina Rish, Rina Dechter - 2000