23 found
Order:
  1.  17
    Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
  2.  28
    Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
  3.  19
    Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
  4.  20
    Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
  5.  16
    Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
  6.  15
    Structure identification in relational data.Rina Dechter & Judea Pearl - 1992 - Artificial Intelligence 58 (1-3):237-270.
  7.  16
    From local to global consistency.Rina Dechter - 1992 - Artificial Intelligence 55 (1):87-107.
  8.  15
    AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.
  9.  18
    Default reasoning using classical logic.Rachel Ben-Eliyahu & Rina Dechter - 1996 - Artificial Intelligence 84 (1-2):113-150.
  10.  11
    Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
  11.  15
    Unifying tree decompositions for reasoning in graphical models.Kalev Kask, Rina Dechter, Javier Larrosa & Avi Dechter - 2005 - Artificial Intelligence 166 (1-2):165-193.
  12.  18
    Topological parameters for time-space tradeoff.Rina Dechter & Yousri El Fattah - 2001 - Artificial Intelligence 125 (1-2):93-118.
  13.  15
    Probabilistic analysis of the complexity of A∗.Nam Huyn, Rina Dechter & Judea Pearl - 1980 - Artificial Intelligence 15 (3):241-254.
  14.  17
    Processing disjunctions in temporal constraint networks.Eddie Schwalb & Rina Dechter - 1997 - Artificial Intelligence 93 (1-2):29-61.
  15.  13
    SampleSearch: Importance sampling in presence of determinism.Vibhav Gogate & Rina Dechter - 2011 - Artificial Intelligence 175 (2):694-729.
  16.  14
    Structure-driven algorithms for truth maintenance.Rina Dechter & Avi Dechter - 1996 - Artificial Intelligence 82 (1-2):1-20.
  17.  14
    AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.
  18.  14
    Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
  19.  9
    Importance sampling-based estimation over AND/OR search spaces for graphical models.Vibhav Gogate & Rina Dechter - 2012 - Artificial Intelligence 184-185 (C):38-77.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  10
    Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  17
    Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  18
    Heuristic search in artificial intelligence.Weixiong Zhang, Rina Dechter & Richard E. Korf - 2001 - Artificial Intelligence 129 (1-2):1-4.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23.  9
    A general scheme for automatic generation of search heuristics from specification dependencies☆☆preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by nsf grant iis-0086529 and by muri onr award n00014-00-1-0617. [REVIEW]Kalev Kask & Rina Dechter - 2001 - Artificial Intelligence 129 (1-2):91-131.