Search the dblp DataBase
Rina Dechter :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Rina Dechter , Itay Meiri , Judea Pearl Temporal Constraint Networks. [Citation Graph (3, 0)][DBLP ] Artif. Intell., 1991, v:49, n:1-3, pp:61-95 [Journal ] Rina Dechter Decomposing an N-ary Relation into a Tree of Binary Relations. [Citation Graph (2, 3)][DBLP ] PODS, 1987, pp:185-189 [Conf ] Rina Dechter , Judea Pearl Network-Based Heuristics for Constraint-Satisfaction Problems. [Citation Graph (2, 0)][DBLP ] Artif. Intell., 1987, v:34, n:1, pp:1-38 [Journal ] Rina Dechter , Judea Pearl Tree Clustering for Constraint Networks. [Citation Graph (2, 0)][DBLP ] Artif. Intell., 1989, v:38, n:3, pp:353-366 [Journal ] Rina Dechter , Judea Pearl Structure Identification in Relational Data. [Citation Graph (2, 0)][DBLP ] Artif. Intell., 1992, v:58, n:1-3, pp:237-270 [Journal ] Rina Dechter Decomposing a Relation into a Tree of Binary Relations. [Citation Graph (2, 0)][DBLP ] J. Comput. Syst. Sci., 1990, v:41, n:1, pp:2-24 [Journal ] Rachel Ben-Eliyahu , Rina Dechter Propositional Sematics for Disjunctive Logic Programs. [Citation Graph (1, 0)][DBLP ] JICSLP, 1992, pp:813-827 [Conf ] Zeev Collin , Rina Dechter , Shmuel Katz On the Feasibility of Distributed Constraint Satisfaction. [Citation Graph (1, 0)][DBLP ] IJCAI, 1991, pp:318-324 [Conf ] Rina Dechter , Judea Pearl The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. [Citation Graph (1, 0)][DBLP ] IJCAI, 1985, pp:1066-1072 [Conf ] Rina Dechter , Itay Meiri , Judea Pearl Temporal Constraint Networks. [Citation Graph (1, 0)][DBLP ] KR, 1989, pp:83-93 [Conf ] Rina Dechter Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. [Citation Graph (1, 0)][DBLP ] Artif. Intell., 1990, v:41, n:3, pp:273-312 [Journal ] Rina Dechter From Local to Global Consistency. [Citation Graph (1, 0)][DBLP ] Artif. Intell., 1992, v:55, n:1, pp:87-108 [Journal ] Rina Dechter , Itay Meiri Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. [Citation Graph (1, 0)][DBLP ] Artif. Intell., 1994, v:68, n:2, pp:211-241 [Journal ] Eddie Schwalb , Rina Dechter Processing Disjunctions in Temporal Constraint Networks. [Citation Graph (1, 0)][DBLP ] Artif. Intell., 1997, v:93, n:, pp:29-61 [Journal ] Peter van Beek , Rina Dechter Constraint tightness and looseness versus local and global consistency. [Citation Graph (1, 0)][DBLP ] J. ACM, 1997, v:44, n:4, pp:549-566 [Journal ] Rina Dechter , Judea Pearl Generalized Best-First Search Strategies and the Optimality of A* [Citation Graph (1, 0)][DBLP ] J. ACM, 1985, v:32, n:3, pp:505-536 [Journal ] Rachel Ben-Eliyahu , Rina Dechter Default Logic, Propositional Logic, and Constraints. [Citation Graph (0, 0)][DBLP ] AAAI, 1991, pp:379-385 [Conf ] Rachel Ben-Eliyahu , Rina Dechter On Computing Minimal Models. [Citation Graph (0, 0)][DBLP ] AAAI, 1993, pp:2-8 [Conf ] Bozhena Bidyuk , Rina Dechter An Anytime Scheme for Bounding Posterior Beliefs. [Citation Graph (0, 0)][DBLP ] AAAI, 2006, pp:- [Conf ] Rina Dechter Learning While Searching in Constraint-Satisfaction-Problems. [Citation Graph (0, 0)][DBLP ] AAAI, 1986, pp:178-185 [Conf ] Rina Dechter On the Expressiveness of Networks with Hidden Variables. [Citation Graph (0, 0)][DBLP ] AAAI, 1990, pp:556-562 [Conf ] Avi Dechter , Rina Dechter Removing Redundancies in Constraint Networks. [Citation Graph (0, 0)][DBLP ] AAAI, 1987, pp:105-109 [Conf ] Rina Dechter , Avi Dechter Belief Maintenance in Dynamic Constraint Networks. [Citation Graph (0, 0)][DBLP ] AAAI, 1988, pp:37-42 [Conf ] Rina Dechter , Kalev Kask , Eyal Bin , Roy Emek Generating Random Solutions for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2002, pp:15-21 [Conf ] Rina Dechter , Judea Pearl The Optimality of A* Revisited. [Citation Graph (0, 0)][DBLP ] AAAI, 1983, pp:95-99 [Conf ] Rina Dechter , Judea Pearl Tree-Clustering Schemes for Constraint-Processing. [Citation Graph (0, 0)][DBLP ] AAAI, 1988, pp:150-154 [Conf ] Daniel Frost , Rina Dechter Dead-End Driven Learning. [Citation Graph (0, 0)][DBLP ] AAAI, 1994, pp:294-300 [Conf ] Daniel Frost , Rina Dechter In Search of the Best Constraint Satisfaction Search. [Citation Graph (0, 0)][DBLP ] AAAI, 1994, pp:301-306 [Conf ] Kalev Kask , Rina Dechter A Graph-Based Method for Improving GSAT. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, Vol. 1, 1996, pp:350-355 [Conf ] Radu Marinescu , Rina Dechter Memory Intensive Branch-and-Bound Search for Graphical Models. [Citation Graph (0, 0)][DBLP ] AAAI, 2006, pp:- [Conf ] Robert Mateescu , Rina Dechter , Kalev Kask Tree Approximation for Belief Updating. [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2002, pp:553-559 [Conf ] Itay Meiri , Judea Pearl , Rina Dechter Tree Decomposition with Applications to Constraint Processing. [Citation Graph (0, 0)][DBLP ] AAAI, 1990, pp:10-16 [Conf ] Robert Menke , Rina Dechter An Implementation of the Combinatorial Auction Problem in ECLi PSe . [Citation Graph (0, 0)][DBLP ] AAAI/IAAI, 2000, pp:1084- [Conf ] Gadi Pinkas , Rina Dechter An Improved Connectionist Activation Function for Energy Minimization. [Citation Graph (0, 0)][DBLP ] AAAI, 1992, pp:434-439 [Conf ] Eddie Schwalb , Rina Dechter Coping With Disjunctions in Temporal Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] AAAI, 1993, pp:127-132 [Conf ] Eddie Schwalb , Kalev Kask , Rina Dechter Temporal Reasoning with Constraints on Fluents and Events. [Citation Graph (0, 0)][DBLP ] AAAI, 1994, pp:1067-1072 [Conf ] Bozhena Bidyuk , Rina Dechter Cycle-Cutset Sampling for Bayesian Networks. [Citation Graph (0, 0)][DBLP ] Canadian Conference on AI, 2003, pp:297-312 [Conf ] Rina Dechter A New Perspective on Algorithms for Optimizing Policies under Uncertainty. [Citation Graph (0, 0)][DBLP ] AIPS, 2000, pp:72-81 [Conf ] Kalev Kask , Rina Dechter , Vibhav Gogate New Look-Ahead Schemes for Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] AMAI, 2004, pp:- [Conf ] Judea Pearl , Rina Dechter Learning Structure from Data: A Survey. [Citation Graph (0, 0)][DBLP ] COLT, 1989, pp:230-244 [Conf ] Rina Dechter , Peter van Beek Local and Global Relational Consistency. [Citation Graph (0, 0)][DBLP ] CP, 1995, pp:240-257 [Conf ] Rina Dechter , Kalev Kask , Javier Larrosa A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:346-360 [Conf ] Rina Dechter , Robert Mateescu The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. [Citation Graph (0, 0)][DBLP ] CP, 2004, pp:731-736 [Conf ] Daniel Frost , Rina Dechter Looking at Full Looking Ahead. [Citation Graph (0, 0)][DBLP ] CP, 1996, pp:539-540 [Conf ] Daniel Frost , Rina Dechter Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. [Citation Graph (0, 0)][DBLP ] CP, 1998, pp:469- [Conf ] Vibhav Gogate , Rina Dechter A New Algorithm for Sampling CSP Solutions Uniformly at Random. [Citation Graph (0, 0)][DBLP ] CP, 2006, pp:711-715 [Conf ] Kalev Kask , Rina Dechter , Vibhav Gogate Counting-Based Look-Ahead Schemes for Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] CP, 2004, pp:317-331 [Conf ] Radu Marinescu , Rina Dechter AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. [Citation Graph (0, 0)][DBLP ] CP, 2005, pp:857- [Conf ] Robert Mateescu , Rina Dechter AND/OR Search Spaces and the Semantic Width of Constraint Networks. [Citation Graph (0, 0)][DBLP ] CP, 2005, pp:860- [Conf ] Robert Mateescu , Rina Dechter Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). [Citation Graph (0, 0)][DBLP ] CP, 2006, pp:329-343 [Conf ] Irina Rish , Rina Dechter To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CP, 1996, pp:555-556 [Conf ] Radu Marinescu , Rina Dechter AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2006, pp:152-166 [Conf ] Bozhena Bidyuk , Rina Dechter Improving Bound Propagation. [Citation Graph (0, 0)][DBLP ] ECAI, 2006, pp:342-346 [Conf ] Radu Marinescu , Rina Dechter Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. [Citation Graph (0, 0)][DBLP ] ECAI, 2006, pp:138-142 [Conf ] Rina Dechter Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. [Citation Graph (0, 0)][DBLP ] IJCAI, 1997, pp:1297-1303 [Conf ] Rina Dechter , Itay Meiri Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] IJCAI, 1989, pp:271-277 [Conf ] Rina Dechter , Judea Pearl Directed Constraint Networks: A Relational Framework for Causal Modeling. [Citation Graph (0, 0)][DBLP ] IJCAI, 1991, pp:1164-1170 [Conf ] Yousri El Fattah , Rina Dechter Diagnosing Tree-Decomposable Circuits. [Citation Graph (0, 0)][DBLP ] IJCAI, 1995, pp:1742-1749 [Conf ] Eugene C. Freuder , Rina Dechter , Matthew L. Ginsberg , Bart Selman , Edward P. K. Tsang Systematic Versus Stochastic Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] IJCAI, 1995, pp:2027-2032 [Conf ] Daniel Frost , Rina Dechter Look-Ahead Value Ordering for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] IJCAI (1), 1995, pp:572-578 [Conf ] Kalev Kask , Rina Dechter GSAT and Local Consistency. [Citation Graph (0, 0)][DBLP ] IJCAI (1), 1995, pp:616-623 [Conf ] Kalev Kask , Rina Dechter Branch and Bound with Mini-Bucket Heuristics. [Citation Graph (0, 0)][DBLP ] IJCAI, 1999, pp:426-435 [Conf ] Radu Marinescu , Rina Dechter AND/OR Branch-and-Bound for Graphical Models. [Citation Graph (0, 0)][DBLP ] IJCAI, 2005, pp:224-229 [Conf ] Robert Mateescu , Rina Dechter AND/OR Cutset Conditioning. [Citation Graph (0, 0)][DBLP ] IJCAI, 2005, pp:230-235 [Conf ] Robert Mateescu , Rina Dechter A Comparison of Time-Space Schemes for Graphical Models. [Citation Graph (0, 0)][DBLP ] IJCAI, 2007, pp:2346-2352 [Conf ] Peter van Beek , Rina Dechter Constraint Tightness versus Global Consistency. [Citation Graph (0, 0)][DBLP ] KR, 1994, pp:572-582 [Conf ] Rina Dechter , Irina Rish Directional Resolution: The Davis-Putnam Procedure, Revisited. [Citation Graph (0, 0)][DBLP ] KR, 1994, pp:134-145 [Conf ] Rina Dechter Constraints and Probabilistic Networks: A Look At The Interface. [Citation Graph (0, 0)][DBLP ] LPNMR, 2004, pp:1- [Conf ] Arun K. Jagota , Rina Dechter Simple distributed algorithms for the cycle cutset problem. [Citation Graph (0, 0)][DBLP ] SAC, 1997, pp:366-373 [Conf ] Eddie Schwalb , Rina Dechter Processing Disjunctions of Temporal Constraints. [Citation Graph (0, 0)][DBLP ] TIME, 1996, pp:- [Conf ] Bozhena Bidyuk , Rina Dechter An Empirical Study of w-Cutset Sampling for Bayesian Networks. [Citation Graph (0, 0)][DBLP ] UAI, 2003, pp:37-46 [Conf ] Rina Dechter Bucket elimination: A unifying framework for probabilistic inference. [Citation Graph (0, 0)][DBLP ] UAI, 1996, pp:211-219 [Conf ] Rina Dechter Topological parameters for time-space tradeoff. [Citation Graph (0, 0)][DBLP ] UAI, 1996, pp:220-227 [Conf ] Rina Dechter , Kalev Kask , Robert Mateescu Iterative Join-Graph Propagation. [Citation Graph (0, 0)][DBLP ] UAI, 2002, pp:128-136 [Conf ] Rina Dechter , David Larkin Hybrid Processing of Beliefs and Constraints. [Citation Graph (0, 0)][DBLP ] UAI, 2001, pp:112-119 [Conf ] Rina Dechter , Robert Mateescu A Simple Insight into Iterative Belief Propagation's Success. [Citation Graph (0, 0)][DBLP ] UAI, 2003, pp:175-183 [Conf ] Rina Dechter , Irina Rish A Scheme for Approximating Probabilistic Inference. [Citation Graph (0, 0)][DBLP ] UAI, 1997, pp:132-141 [Conf ] Yousri El Fattah , Rina Dechter An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. [Citation Graph (0, 0)][DBLP ] UAI, 1996, pp:244-251 [Conf ] Kalev Kask , Rina Dechter Mini-Bucket Heuristics for Improved Search. [Citation Graph (0, 0)][DBLP ] UAI, 1999, pp:314-323 [Conf ] Radu Marinescu , Kalev Kask , Rina Dechter Systematic vs. Non-systematic Algorithms for Solving the MPE Task. [Citation Graph (0, 0)][DBLP ] UAI, 2003, pp:394-402 [Conf ] Judea Pearl , Rina Dechter Identifying Independencies in Causal Graphs with Feedback. [Citation Graph (0, 0)][DBLP ] UAI, 1996, pp:420-426 [Conf ] Irina Rish , Kalev Kask , Rina Dechter Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. [Citation Graph (0, 0)][DBLP ] UAI, 1998, pp:455-463 [Conf ] Rachel Ben-Eliyahu , Rina Dechter Default Reasoning Using Classical Logic. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1996, v:84, n:1-2, pp:113-150 [Journal ] Rina Dechter Bucket Elimination: A Unifying Framework for Reasoning. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1999, v:113, n:1-2, pp:41-85 [Journal ] Rina Dechter , Avi Dechter Structure-Driven Algorithms for Truth Maintenance. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1996, v:82, n:1-2, pp:1-2 [Journal ] Rina Dechter , Yousri El Fattah Topological parameters for time-space tradeoff. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2001, v:125, n:1-2, pp:93-118 [Journal ] Rina Dechter , Daniel Frost Backjump-based backtracking for constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2002, v:136, n:2, pp:147-188 [Journal ] Nam Huyn , Rina Dechter , Judea Pearl Probabilistic Analysis of the Complexity of A* . [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1980, v:15, n:3, pp:241-254 [Journal ] Kalev Kask , Rina Dechter A general scheme for automatic generation of search heuristics from specification dependencies. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2001, v:129, n:1-2, pp:91-131 [Journal ] Kalev Kask , Rina Dechter , Javier Larrosa , Avi Dechter Unifying tree decompositions for reasoning in graphical models. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2005, v:166, n:1-2, pp:165-193 [Journal ] Itay Meiri , Rina Dechter , Judea Pearl Uncovering Trees in Constraint Networks. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1996, v:86, n:2, pp:245-267 [Journal ] Weixiong Zhang , Rina Dechter , Richard E. Korf Heuristic search in artificial intelligence. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2001, v:129, n:1-2, pp:1-4 [Journal ] Rina Dechter , Robert Mateescu AND/OR search spaces for graphical models. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2007, v:171, n:2-3, pp:73-106 [Journal ] Rachel Ben-Eliyahu , Rina Dechter Propositional Semantics for Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 1994, v:12, n:1-2, pp:53-87 [Journal ] Rachel Ben-Eliyahu , Rina Dechter On Computing Minimal Models. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 1996, v:18, n:1, pp:3-27 [Journal ] Daniel Frost , Rina Dechter Maintenance scheduling problems as benchmarks for constraint algorithms. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 1999, v:26, n:1-4, pp:149-170 [Journal ] Zeev Collin , Rina Dechter , Shmuel Katz Self-Stabilizing Distributed Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal ] Javier Larrosa , Rina Dechter Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] Constraints, 2003, v:8, n:3, pp:303-326 [Journal ] Rina Dechter Guest Editorial. [Citation Graph (0, 0)][DBLP ] Constraints, 2003, v:8, n:3, pp:227-228 [Journal ] Rina Dechter Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. [Citation Graph (0, 0)][DBLP ] Constraints, 1997, v:2, n:1, pp:51-55 [Journal ] Rina Dechter Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints. [Citation Graph (0, 0)][DBLP ] ACM Comput. Surv., 1996, v:28, n:4es, pp:61- [Journal ] Peter van Beek , Rina Dechter On the Minimality and Decomposability of Row-Convex Constraint Networks. [Citation Graph (0, 0)][DBLP ] J. ACM, 1995, v:42, n:3, pp:543-561 [Journal ] Rina Dechter , Irina Rish Mini-buckets: A general scheme for bounded inference. [Citation Graph (0, 0)][DBLP ] J. ACM, 2003, v:50, n:2, pp:107-153 [Journal ] Gadi Pinkas , Rina Dechter Improving Connectionist Energy Minimization. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 1995, v:3, n:, pp:223-248 [Journal ] Irina Rish , Rina Dechter Resolution versus Search: Two Strategies for SAT. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2000, v:24, n:1/2, pp:225-275 [Journal ] Rina Dechter , Leonard Kleinrock Broadcast Communications and Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1986, v:35, n:3, pp:210-219 [Journal ] Rina Dechter , Peter van Beek Local and Global Relational Consistency. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:173, n:1, pp:283-308 [Journal ] Radu Marinescu , Rina Dechter Best-First AND/OR Search for Graphical Models. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:1171-1176 [Conf ] Vibhav Gogate , Rina Dechter Approximate Counting by Sampling the Backtrack-free Search Space. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:198-203 [Conf ] Robert Mateescu , Radu Marinescu , Rina Dechter AND/OR Multi-valued Decision Diagrams for Constraint Optimization. [Citation Graph (0, 0)][DBLP ] CP, 2007, pp:498-513 [Conf ] Radu Marinescu , Rina Dechter Best-First AND/OR Search for 0/1 Integer Programming. [Citation Graph (0, 0)][DBLP ] CPAIOR, 2007, pp:171-185 [Conf ] Vibhav Gogate , Rina Dechter Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. [Citation Graph (0, 0)][DBLP ] UAI, 2005, pp:209-216 [Conf ] Robert Mateescu , Rina Dechter The Relationship Between AND/OR Search and Variable Elimination. [Citation Graph (0, 0)][DBLP ] UAI, 2005, pp:380-387 [Conf ] Vibhav Gogate , Rina Dechter , Bozhena Bidyuk , Craig Rindt , James Marca Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. [Citation Graph (0, 0)][DBLP ] UAI, 2005, pp:217-224 [Conf ] Bozhena Bidyuk , Rina Dechter On Finding Minimal w-cutset. [Citation Graph (0, 0)][DBLP ] UAI, 2004, pp:43-50 [Conf ] Rina Dechter , Robert Mateescu Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. [Citation Graph (0, 0)][DBLP ] UAI, 2004, pp:120-129 [Conf ] Vibhav Gogate , Rina Dechter A Complete Anytime Algorithm for Treewidth. [Citation Graph (0, 0)][DBLP ] UAI, 2004, pp:201-208 [Conf ] Bozhena Bidyuk , Rina Dechter Cutset Sampling with Likelihood Weighting. [Citation Graph (0, 0)][DBLP ] UAI, 2006, pp:- [Conf ] Bozhena Bidyuk , Rina Dechter Cutset Sampling for Bayesian Networks. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2007, v:28, n:, pp:1-48 [Journal ] Studies in Solution Sampling. [Citation Graph (, )][DBLP ] New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. [Citation Graph (, )][DBLP ] AND/OR Multi-valued Decision Diagrams for Constraint Networks. [Citation Graph (, )][DBLP ] Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. [Citation Graph (, )][DBLP ] Approximate Solution Sampling (and Counting) on AND/OR Spaces. [Citation Graph (, )][DBLP ] Robust Solutions in Unstable Optimization Problems. [Citation Graph (, )][DBLP ] On the Practical Significance of Hypertree vs. TreeWidth. [Citation Graph (, )][DBLP ] AND/OR Importance Sampling. [Citation Graph (, )][DBLP ] Bounding Search Space Size via (Hyper)tree Decompositions. [Citation Graph (, )][DBLP ] Memory intensive AND/OR search for combinatorial optimization in graphical models. [Citation Graph (, )][DBLP ] AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. [Citation Graph (, )][DBLP ] Mixed deterministic and probabilistic networks. [Citation Graph (, )][DBLP ] Evaluating the impact of AND/OR search on 0-1 integer linear programming. [Citation Graph (, )][DBLP ] Search in 0.052secs, Finished in 0.061secs