Eugene C. Freuder and Michael J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In Proceedings of International Joint Conference on Artificial Intellgence, pages 1076--1078, 1985. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Counting Models using Connected Components - Bayardo, Jr., Pehoushek (2000) (10 citations) (Correct)
Constraint Networks: A Survey - Yang, Yang (1997) (1 citation) (Correct)
A Complexity Analysis of Space-Bounded Learning Algorithms.. - Bayardo, Miranker (1996) (42 citations) (Correct)
Processing Queries for First-Few Answers - Bayardo, Jr. (1996) (16 citations) (Correct)
Automating Software Design For Resource Assignment Problems - Voigt (1995) (Correct)
Algorithms for Constraint Satisfaction Problems: A Survey - Kumar (1992) (191 citations) (Correct)
A Decentralized Variable Ordering - Method For Distributed (2005) (Correct)
AND/OR Tree Search for Constraint Optimization - Radu Marinescu And (Correct)
The Impact of AND/OR Search Spaces on Constraint - Satisfaction And Counting (Correct)
ADOPT: Asynchronous Distributed Constraint Optimization.. - Modi, Shen, Tambe, Yokoo (2004) (4 citations) (Correct)
ADOPT: Asynchronous Distributed Constraint Optimization.. - Modi, Shen, Tambe, Yokoo (2005) (4 citations) (Correct)
Backtrack-Bounded Search in Polynomial Space - Roberto Bayardo Jr (Correct)
A survey on Constraint Satisfaction Problems - Spatial.. - Meretakis, Cheong (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC