E.C. Freuder. A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1):24--32, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Tractable Tree Convex Constraint Networks - Yuanlin Zhang And Self-citation (Freuder) (Correct)
No context found.
Freuder, E. 1982. A sufficient condition for backtrack-free search. Journal of The ACM 29(1):24--32.
Semi-Automatic Modeling by Constraint Acquisition - Remi Coletta Christian (2003) Self-citation (Freuder) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24--32, Jan. 1982.
Satisfaction Guaranteed - Eugene Freuder And Self-citation (Freuder) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of ACM, 29(1):24--32, 1982.
Approximated Consistency for the - Automatic Recording Problem (2005) (Correct)
No context found.
E.C. Freuder. A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1):24--32, 1982.
Approximated Consistency for the - Automatic Recording Problem (Correct)
No context found.
E.C. Freuder. A Sufficient Condition for Backtrack-Free Search. Journal of the ACM, 29(1):24--32, 1982.
Global Consistency in Interval Algebra Networks: - Tractable Subclasses Christian (Correct)
No context found.
Freuder 82 Freuder, E.C., A Sufficient Condition for Backtrackfree Search, Journal of the ACM 29 (1982) 24 \Gamma 32.
Distributing Constraints by Sampling in Non-binary CSPs - Salido, Giret, Barber (2003) (Correct)
No context found.
Freuder, E. 1982. A sufficient condition for backtrack-free search. Journal of the ACM 29:24--32.
Secure Multi-party Computation for selecting a solution according .. - Silaghi (2004) (Correct)
No context found.
E. C. Freuder. A sufficient condition for backtrackfree search. In JACM'82, volume 29, pages 24--32, Jan 1982.
Consistency and Set Intersection - Yuanlin Zhang And (2003) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of The ACM, 29(1):24--32, 1982.
Consistency Techniques for Linear Arithmetic and Functional.. - Zhang (1998) (Correct)
No context found.
Freuder, E.C., A sufficient condition for backtrack-free search, Journal of ACM, Vol 29(1),241//
Variable Independence in Markov Decision Problems - Rish, Dechter (Correct)
No context found.
E.C. Freuder, A sufficient condition for backtrackfree search. Journal of the ACM, 29, 1982, 24-32.
Constraint Query Algebras - Goldin (1997) (17 citations) (Correct)
No context found.
E. Freuder. A sufficient condition for backtrack-free search. CACM, 29:1, 1982.
Combining Qualitative and Quantitative Constraints in Temporal.. - Meiri (1995) (107 citations) (Correct)
No context found.
E. C. Freuder. A sufficient condition of backtrack-free search. JACM, 29:24--32, 1982.
Decomposable Constraints - Ian Gent Computer (1999) (7 citations) (Correct)
No context found.
E. Freuder. A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery, 29(1):24--32, 1982.
Constraint Satisfaction Methods for Information Personalization - Abidi, Chong (Correct)
No context found.
Freuder E, A sufficient condition for backtrack-free search. Communications of the ACM, 1982, Vol. 29(1), pp. 24-32.
A General Scheme for Multiple Lower Bound - Computation In Constraint (Correct)
No context found.
Eugene Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29:24--32, March 1982.
Artificial Intelligence 123 (2000) 133--156 - Decomposable Constraints Ian (Correct)
No context found.
E. Freuder, A sufficient condition for backtrack-free search, J. ACM 29 (1982) 24--32.
On the Minimality and Global Consistency of Row-Convex.. - van Beek, Dechter (13 citations) (Correct)
No context found.
E. C. Freuder. A sufficient condition for backtrack-free search. J. ACM, 29:24--32, 1982.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24--32, 1982.
Distributed Construction of Almost-Edge-Disjoint Spanning.. - Luccio, Pagli (2002) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM 29 (1982) 24-32.
Answering Queries: Tractable Cases and Optimizations - Scarcello (2001) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24-- 32, 1982.
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (4 citations) (Correct)
No context found.
E. C. Freuder. A sufficient condition for backtrack-free search. JACM, 21(11):958--965, 1982.
Constraints, Varieties, and Algorithms - van Dongen (2002) (Correct)
No context found.
E.C. Freuder. A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24--32, 1982.
Reasoning with Disjunctive Fuzzy Temporal Constraint Networks - Bosch, Torres, Marin (2002) (Correct)
No context found.
Freuder, E.: A sufficient condition for backtrack-free search. Journal of the ACM 29, 1 (1982) 24-32
Closure Functions and Width 1 Problems - Dalmau, Pearson (1999) (2 citations) (Correct)
No context found.
E.C. Freuder. A Sufficient Condition for Backtrack-free Search. Journal of the ACM, 29:24--32, 1982.
First 50 documents Next 50
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