Rina Dechter

Q: What Schools Are Affiliated With Rina Dechter

Rina Dechter is affiliated with the following schools: Oregon State University, University of California, Irvine, University of California, Los Angeles

Rina Dechter's AcademicInfluence.com Rankings

Rina Dechter

Computer Science

#226

World Rank

#235

Historical Rank

Programming

#33

World Rank

#35

Historical Rank

Artificial Intelligence

#96

World Rank

#99

Historical Rank

Database

#519

World Rank

#543

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Rina Dechter Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rina Dechter is a distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine. Her research is on automated reasoning in artificial intelligence focusing on probabilistic and constraint-based reasoning. In 2013, she was elected a Fellow of the Association for Computing Machinery.

(See a Problem?)

Rina Dechter's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Temporal Constraint Networks (1989) (2168)
Generalized best-first search strategies and the optimality of A* (1985) (1063)
Constraint Processing (1995) (1041)
Bucket Elimination: A Unifying Framework for Reasoning (1999) (696)
Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition (1990) (638)
Network-Based Heuristics for Constraint-Satisfaction Problems (1987) (637)
Tree Clustering for Constraint Networks (1989) (632)
Bucket elimination: A unifying framework for probabilistic inference (1996) (559)
Network-based heuristics for constraint satisfaction problems (1988) (364)
Belief Maintenance in Dynamic Constraint Networks (1988) (326)
to Constraint Satisfaction (1991) (325)
AND/OR search spaces for graphical models (2007) (298)
Propositional semantics for disjunctive logic programs (1994) (223)
Mini-buckets: A general scheme for bounded inference (2003) (217)
From Local to Global Consistency (1990) (215)
Learning While Searching in Constraint-Satisfaction-Problems (1986) (210)
Directional Resolution: The Davis-Putnam Procedure, Revisited (1994) (179)
A Complete Anytime Algorithm for Treewidth (2004) (178)
Local and Global Relational Consistency (1995) (149)
Structure Identification in Relational Data (1992) (144)
Look-Ahead Value Ordering for Constraint Satisfaction Problems (1995) (143)
Principles and Practice of Constraint Programming – CP 2000 (2001) (141)
On the minimality and global consistency of row-convex constraint networks (1995) (133)
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems (1989) (131)
Resolution versus Search: Two Strategies for SAT (2000) (129)
Dead-End Driven Learning (1994) (120)
Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems (1994) (118)
Backjump-based backtracking for constraint satisfaction problems (2002) (118)
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models (2009) (117)
Topological parameters for time-space tradeoff (1996) (113)
SampleSearch: Importance sampling in presence of determinism (2011) (107)
Unifying tree decompositions for reasoning in graphical models (2005) (103)
On the Feasibility of Distributed Constraint Satisfaction (1991) (99)
AND/OR Branch-and-Bound for Graphical Models (2005) (94)
A general scheme for automatic generation of search heuristics from specification dependencies (2001) (90)
Identifying Independencies in Causal Graphs with Feedback (1996) (89)
Processing Disjunctions in Temporal Constraint Networks (1997) (88)
Heuristics, Probability and Causality. A Tribute to Judea Pearl (2010) (87)
Iterative Join-Graph Propagation (2002) (87)
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning (1997) (86)
Diagnosing Tree-Decomposable Circuits (1995) (83)
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space (2004) (82)
A Scheme for Approximating Probabilistic Inference (1997) (80)
In Search of the Best Constraint Satisfaction Search (1994) (80)
Systematic Versus Stochastic Constraint Satisfaction (1995) (80)
Tree-Clustering Schemes for Constraint-Processing (1988) (79)
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms (2013) (78)
Broadcast Communications and Distributed Algorithms (1986) (78)
Mini-buckets: a general scheme for approximating inference (2002) (67)
Join-Graph Propagation Algorithms (2010) (61)
Stochastic Local Search for Bayesian Networks (1999) (61)
The optimality of A (1988) (61)
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems (2003) (60)
Stochastic local search for Bayesian network (1999) (59)
Approximate Counting by Sampling the Backtrack-free Search Space (2007) (58)
Generating random solutions for constraint satisfaction problems (2002) (58)
Anytime AND/OR depth-first search for combinatorial optimization (2012) (58)
Cutset Sampling for Bayesian Networks (2011) (57)
Memory intensive AND/OR search for combinatorial optimization in graphical models (2009) (57)
Constraint tightness and looseness versus local and global consistency (1997) (57)
Self-Stabilizing Distributed Constraint Satisfaction (1999) (56)
A New Algorithm for Sampling CSP Solutions Uniformly at Random (2006) (55)
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models (2008) (53)
Bayesian Inference in the Presence of Determinism (2003) (50)
Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints (1996) (50)
Effect Heterogeneity and Bias in Main-Effects-Only Regression Models (2010) (49)
On the Expressiveness of Networks with Hidden Variables (1990) (49)
Probabilistic Analysis of the Complexity of A* (1980) (47)
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints (2005) (45)
Mixed deterministic and probabilistic networks (2008) (45)
Join-graph based cost-shifting schemes (2012) (45)
SampleSearch: A Scheme that Searches for Consistent Samples (2007) (45)
Directed Constraint Networks: A Relational Framework for Causal Modeling (1991) (44)
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models (2011) (44)
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees (2013) (43)
Counting-Based Look-Ahead Schemes for Constraint Satisfaction (2004) (43)
Default Logic, Propositional Logic, and Constraints (1991) (42)
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization (2001) (42)
On computing minimal models (1993) (42)
GSAT and Local Consistency (1995) (42)
Removing Redundancies in Constraint Networks (1987) (41)
Structure-Driven Algorithms for Truth Maintenance (1996) (41)
AND/OR Search for Marginal MAP (2014) (41)
A New Perspective on Algorithms for Optimizing Policies under Uncertainty (2000) (40)
Tractable Structures for Constraint Satisfaction Problems (2006) (40)
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs) (2006) (39)
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting (2004) (39)
Decomposing a Relation into a Tree of Binary Relations (1990) (38)
AND/OR Cutset Conditioning (2005) (37)
Hybrid Processing of Beliefs and Constraints (2001) (37)
Value iteration and policy iteration algorithms for Markov decision problem (1996) (36)
Default Reasoning Using Classical Logic (1996) (36)
Branch and Bound with Mini-Bucket Heuristics (1999) (35)
Improving Connectionist Energy Minimization (1995) (35)
Best-First AND/OR Search for Graphical Models (2007) (34)
Artificial Intelligence Techniques (1997) (34)
The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation (1985) (34)
The Relationship Between AND/OR Search and Variable Elimination (2005) (33)
Predicting the Size of Depth-First Branch and Bound Search Trees (2013) (33)
Search Algorithms for m Best Solutions for Graphical Models (2012) (32)
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks (2005) (32)
Backtracking Algorithms for Constraint Satisfaction Problems (1999) (31)
Unifying Cluster-Tree Decompositions for Reasoning in Graphical models ∗ (2005) (30)
Algorithms and heuristics for constraint satisfaction problems (1997) (30)
Mini-Bucket Heuristics for Improved Search (1999) (30)
Finding All Solutions if You can Find One (1992) (29)
Eighteenth national conference on Artificial intelligence (2002) (29)
Probabilistic Inference Modulo Theories (2016) (29)
AND/OR Tree Search for Constraint Optimization (2004) (28)
A Simple Insight into Iterative Belief Propagation's Success (2002) (25)
Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models (2011) (25)
The Optimality of A* Revisited (1983) (24)
Coping With Disjunctions in Temporal Constraint Satisfaction Problems (1993) (24)
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits (1996) (24)
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units (1998) (23)
Tree approximation for belief updating (2002) (23)
Unifying Cluster-Tree Decompositions for Automated Reasoning (2003) (23)
On the impact of causal independence (1998) (23)
Constraint Tightness versus Global Consistency (1994) (22)
Bucket-Tree Elimination for Automated Reasoning (2001) (22)
An Empirical Study of w-Cutset Sampling for Bayesian Networks (2002) (21)
Memory Intensive Branch-and-Bound Search for Graphical Models (2006) (21)
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models (2006) (21)
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence (2010) (21)
Cycle-Cutset Sampling for Bayesian Networks (2003) (20)
Sampling algorithms for probabilistic graphical models with determinism (2009) (20)
On the Dual Representation of Non-binary Semiring-based CSPs (2000) (20)
Winning the PASCAL 2011 MAP Challenge with Enhanced AND / OR Branch-and-Bound (2011) (20)
Temporal Reasoning with Constraints on Fluents and Events (1994) (19)
Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (2000) (19)
Efficient reasoning in graphical models (1999) (18)
Dynamic Importance Sampling for Anytime Bounds of the Partition Function (2017) (18)
An Anytime Scheme for Bounding Posterior Beliefs (2006) (18)
On Finding Minimal w-cutset (2004) (18)
Propositional semantics for default logic (1992) (18)
Systematic vs. Non-systematic Algorithms for Solving the MPE Task (2002) (17)
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding (1998) (17)
A Graph-Based Method for Improving GSAT (1996) (17)
From Exact to Anytime Solutions for Marginal MAP (2016) (16)
Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality (2007) (16)
Up and Down Mini-Buckets: A Scheme for Approximating Combinatorial Optimization Tasks (2001) (16)
An Anytime Approximation For Optimizing Policies Under Uncertainty (2000) (16)
BEEM : Bucket Elimination with External Memory (2010) (15)
Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (2016) (15)
Tree Decomposition with Applications to Constraint Processing (1990) (15)
On finding minimal w-cutset problem (2004) (14)
Importance sampling-based estimation over AND/OR search spaces for graphical models (2012) (14)
To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract) (1996) (14)
A distributed solution to the network consistency problem (1991) (14)
Anytime Anyspace AND/OR Search for Bounding the Partition Function (2017) (13)
Searching for the M Best Solutions in Graphical Models (2016) (13)
Pushing Forward Marginal MAP with Best-First Search (2015) (13)
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models (2012) (13)
Anytime Best+Depth-First Search for Bounding Marginal MAP (2017) (13)
Toward parallel search for optimization in graphical models (2010) (12)
AND/OR Branch-and-Bound on a Computational Grid (2017) (12)
Studies in Solution Sampling (2008) (12)
Maintenance scheduling problems as benchmarks for constraint algorithms (1999) (12)
Approximate Solution Sampling (and Counting) on AND/OR Spaces (2008) (12)
On the Greedy Solution of Ordering Problems (1989) (12)
AND/OR Importance Sampling (2008) (11)
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results (2016) (11)
Approximation algorithms for graphical models (2001) (11)
Temporal reasoning with constraints (1998) (11)
And/or search strategies for combinatorial optimization in graphical models (2008) (11)
Best-First AND/OR Search for Most Probable Explanations (2007) (11)
Exploiting graph cutsets for sampling-based approximations in bayesian networks (2006) (11)
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models (2007) (10)
Empirical evaluation of diagnosis as optimization in constraint networks (1992) (10)
Advances in AND / OR Branch-and-Bound Search for Constraint Optimization (2005) (10)
The Relationship Between AND / OR Search Spaces and Variable Elimination (2005) (10)
Learning structure from data: a survey (1989) (10)
Bucket Elimination: A Unifying Framework for Several Probabilistic Inference (2013) (9)
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems (2006) (9)
Improving Bound Propagation (2006) (9)
Join Graph Decomposition Bounds for Influence Diagrams (2018) (8)
Constraint processing incorporating, back jumping, learning, and cutset-decomposition (1988) (8)
Inference Schemes for M Best Solutions for Soft CSPs (2011) (8)
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition (2019) (8)
Deep Bucket Elimination (2021) (8)
An Improved Connectionist Activation Function for Energy Minimization (1992) (8)
Sampling-based lower bounds for counting queries (2011) (8)
Semiring-Based Mini-Bucket Partitioning Schemes (2013) (8)
A Weighted Mini-Bucket Bound for Solving Influence Diagram (2019) (8)
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models (2014) (8)
A problem simplification approach that generates heuristics for constraint-satisfaction problems (1988) (8)
Active Tuples-based Scheme for Bounding Posterior Beliefs (2010) (7)
Backtracking Algorithms for Constraint Satisfaction Problems -- a Survey (1998) (7)
Processing disjunctions of temporal constraints (1996) (7)
Weighted heuristic anytime search: new schemes for optimization over graphical models (2017) (7)
Cutset Sampling with Likelihood Weighting (2006) (7)
Dynamic Combination of Search and Variable Elimination in CSP and Max-CSP (2003) (7)
New Look-Ahead Schemes for Constraint Satisfaction (2004) (7)
A Comparison of Time-Space Schemes for Graphical Models (2007) (7)
Processing Temporal Constraint Networks (2008) (6)
Temporal Constraints in Planning : Free or not Free ? (1995) (6)
Looking at Full Looking Ahead (1996) (6)
Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results (2014) (6)
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing (2011) (6)
Evaluating the impact of AND/OR search on 0-1 integer linear programming (2009) (6)
Decomposing an N-ary relation into a tree of binary relations (1987) (6)
Uncovering Trees in Constraint Networks (1996) (6)
Artificial intelligence journal special issue on heuristic search (1999) (6)
Bounding Search Space Size via (Hyper)tree Decompositions (2008) (6)
chapter 12 – Temporal Constraint Networks (2003) (6)
Evaluating partition strategies for mini-bucket elimination (2010) (5)
Scaling Up AND/OR Abstraction Sampling (2020) (5)
Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP (2018) (5)
AND/OR Multi-valued Decision Diagrams for Constraint Networks (2008) (5)
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models (2017) (5)
M best solutions over Graphical Models (2010) (5)
Mini-bucket Elimination with Moment Matching (2011) (5)
On Combining Graph-based Variance Reduction schemes (2010) (5)
Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms (2019) (5)
Robust Solutions in Unstable Optimization Problems (2009) (5)
Approximate Solution Sampling ( and Counting ) on AND / OR search space (2008) (4)
it in Temporal Constraint (1993) (4)
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems (2008) (4)
Heuristic search in artificial intelligence (2001) (4)
Constraint Directed Reasoning (1988) (4)
Subproblem ordering heuristics for AND/OR best-first search (2017) (4)
Benchmark on DAOOPT and GUROBI with the PASCAL 2 Inference Challenge Problems (2013) (4)
Best-First AND/OR Search for 0/1 Integer Programming (2007) (4)
Heuristic Search for m Best Solutions with Applications to Graphical Models (2011) (4)
The Personal Travel Assistant (PTA): Measuring the Dynamics of Human Travel Behavior (2010) (4)
Load Balancing for Parallel Branch and Bound ⋆ (2010) (4)
AND/OR Multi-valued Decision Diagrams for Constraint Optimization (2007) (4)
On the Practical Significance of Hypertree vs. TreeWidth (2008) (4)
Studies in the use and generation of heuristics (greedy algorithms) (1985) (4)
Search Algorithms for Solving Queries on Graphical Models & the Importance of Pseudo-trees in their Complexity (2017) (4)
Bucket Elimination: a Unifying Framework for Structure-driven Inference (2008) (3)
Editorial: The Competition Section: a new paper category (2011) (3)
Uncertainty in artificial intelligence : proceedings of the Twenty-second Conference (2006) : July 13-16, 2006, Cambridge, MA (2006) (3)
Stochastic Anytime Search for Bounding Marginal MAP (2018) (3)
Stopping Rules for Randomized Greedy Triangulation Schemes (2011) (3)
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models (2016) (3)
On the Power of Belief Propagation: A Constraint Propagation Perspective (2010) (3)
Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006) (2012) (3)
Submodel Decomposition Bounds for Influence Diagrams (2021) (3)
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems (2005) (3)
An Implementation of the Combinatorial Auction Problem in ECLiPSe (2000) (3)
chapter 7 – Stochastic Greedy Local Search (2003) (3)
Inference in inheritance networks using propositional logic and constraint networks techniques (1992) (2)
Processing Boolean queries over Belief networks (2000) (2)
chapter 4 – Directional Consistency (2003) (2)
Using Mini-Bucket Heuristics for Max-CSP (2000) (2)
chapter 13 – Constraint Optimization (2003) (2)
Simple distributed algorithms for the cycle cutset problem (1997) (2)
Anytime Recursive Best-First Search for Bounding Marginal MAP (2019) (1)
Bucket-Tree Elimination for Automated (2001) (1)
Approximating Spatial Evolutionary Games using Bayesian Networks (2021) (1)
Evaluating probabilistic reasoning systems (2008) (1)
Caching in Context-Minimal OR Spaces (2015) (1)
Anytime AND/OR Best-First Search for Optimization in Graphical Models (2013) (1)
Advances in Distributed Branch and Bound (2012) (1)
On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds (2016) (1)
Counting the Optimal Solutions in Graphical Models (2019) (1)
A Simple Application of Sampling Importance Resampling ( SIR ) for Solution Sampling (2007) (1)
chapter 2 – Constraint Networks (2003) (1)
Finite-sample Bounds for Marginal MAP (2018) (1)
Maximum Likelihood Haplotyping through Parallelized Search on a Grid of Computers (2009) (1)
Evaluating Constraint Processing Algorithms (1998) (1)
Principles and practice of constraint programming - CP 2000 : 6th International Conference, CP2000, Singapore, September 18-21, 2000 : proceedings (2000) (1)
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics (2014) (1)
Compiling Relational Data into Disjunctive Structure : Empirical Evaluation (1994) (1)
Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall (2018) (1)
chapter 9 – Tree Decomposition Methods (2003) (1)
AND/OR Search Spaces and the Semantic Width of Constraint Networks (2005) (1)
Processing Probabilistic and Deterministic Graphical Models (2013) (1)
STLS: Cycle-Cutset-Driven Local Search For MPE (2014) (1)
Evaluating Weighted DFS Branch and Bound over Graphical Models (2014) (1)
Weighted Best First Search for Graphical Models (2014) (1)
An Improved Activation Function for Energy Minimization (1992) (1)
Look-Ahead with Mini-Bucket Heuristics for MPE (2016) (1)
NeuroBE: Escalating neural network approximations of Bucket Elimination (2022) (1)
Weighted anytime search : new schemes for optimization over graphical models (2014) (1)
chapter 5 – General Search Strategies: Look-Ahead (2003) (1)
AND / OR Graph Search for Genetic Linkage Analysis (2006) (1)
Epsilon-cutset effect in Bayesian networks of arbitrary topology (1998) (1)
A Comparison of Time-Space Schemes (2006) (0)
Preface: the AAAI-02 conference (2002) (0)
When is local consistency sufficient (1991) (0)
A New Bounding Scheme for Influence Diagrams (2021) (0)
Proceedings of the Twenty-Second Conference Conference on Uncertainty in Artificial Intelligence (2006) (2006) (0)
REES : Reasoning Engine ( s ) Evaluation Shell (2003) (0)
On Computing Mini (1993) (0)
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation (2015) (0)
ct ivat ion Function for inimieat ion (1992) (0)
Constraint processing for optimal maintenance scheduling (1991) (0)
Title Active tuples-based scheme for bounding posterior beliefs Permalink (2010) (0)
Proceedings of the Seventh International Workshop on Preferences and Soft Constraints (2005) (0)
Gsat and Local Consistency 3 (1995) (0)
Constraint Networks Techniques (2015) (0)
AND/OR branch-and-bound for computational protein design optimizing K (2022) (0)
chapter 14 – Probabilistic Networks (2003) (0)
Anytime Depth-First Search with Problem Decomposition for Optimization in Graphical Models (2010) (0)
Human Resources Test and Evaluation System (HRTES). Volume 1. Comprehensive Handbook (1984) (0)
Line Space (2012) (0)
Mini-buckets : a general scheme for approximatinginferenceRina (1998) (0)
Constraint Programming the Constraint Programming Working Group Acm-mit Sdcr Workshop (1996) (0)
Selecting DaoOpt solver configuration for MPE problems (2016) (0)
Weighted heuristic anytime search: new schemes for optimization over graphical models (2016) (0)
EXPRESSIVENESS NVA LES Rina Dechter (1999) (0)
Title of Publication: Encyclopedia of Cognitive Science. Article title: Constraint Satisfaction. Article code: 26. Authors: (0)
Empirical Evaluation of AND / OR Multivalued Decision Diagrams for Inference Student : (2012) (0)
Constraints and Probabilistic Networks: A Look At The Interface (2004) (0)
Empirical evaluation of two versions of the Davis-Putnam algorithm (2007) (0)
Bounding Inference: Mini-bucket and Mini-clustering Schemes (0)
Study for Handling Hybrid Influence Diagrams in Probabilistic Programming Language Figaro with Discrete Algorithms (2018) (0)
Weighted Best-First Search for W-Optimal Solutions over Graphical Models (2014) (0)
chapter 6 – General Search Strategies: Look-Back (2003) (0)
Reasoning with Probabilistic and Deterministic Graphical Models (2013) (0)
chapter 3 – Consistency-Enforcing and Constraint Propagation (2003) (0)
Bounding Graphical Models Processing by Hypertree Width Student : (2007) (0)
Working notes of the 1991 spring symposium on constraint-based reasoning (1991) (0)
Variable Independence in Markov Decision Problems (1996) (0)
Advancing AND / OR Search for Optimization Using Diverse Principles (2008) (0)
chapter 10 – Hybrids of Search and Inference: Time-Space Trade-Offs (2003) (0)
chapter 8 – Advanced Consistency Methods (2003) (0)
Heuristic AND/OR Search for Solving Influence Diagram (2021) (0)
Directional Resolution (1994) (0)
Fast Fourier Transform Reductions for Bayesian Network Inference (2022) (0)
A Mini-bucket-based Scheme for Approximating Combinatorial Optimization Tasks: Preliminary Results (2000) (0)
An Anytime Boosting Scheme for Bounding Posterior Beliefs 1 (2009) (0)
Sampling over Search Trees Using Abstractions (2017) (0)
Reasoning with Graphical Models (2011) (0)
Belief Propagation in a Bucket-tree Handouts, 275b Fall-2000 (0)
Empirical Evaluation of AND / OR Multivalued Decision Diagrams for Compilation and Inference (2012) (0)
NeuroBE: Escalating NN Approximations to Bucket Elimination (2021) (0)
Combining Search and Inference; Trading Space for Time 7.1 the Cycle-cutset and W-cutset Schemes (0)
Approximation Methods for Inference and Learning in Belief Networks: Progress and Future Directions (1997) (0)
Up and Down Mini-Buckets : A Scheme for Approximating Combinatorial Optimization Tasks Tracking number : 708 (2001) (0)
Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs (2017) (0)
A Constraint View of IBD Graphs (2010) (0)
Constraint Networks (2015) (0)
Guest Editorial (2004) (0)
Program committee (2022) (0)
STLS: Cutset-Driven Local Search For MPE (2014) (0)

This paper list is powered by the following services:

Other Resources About Rina Dechter

en.wikipedia.org

What Schools Are Affiliated With Rina Dechter?

Rina Dechter is affiliated with the following schools:

Rina Dechter's Academic­Influence.com Rankings

Why Is Rina Dechter Influential?

Rina Dechter's Published Works

Published Works

Other Resources About Rina Dechter

What Schools Are Affiliated With Rina Dechter?

Image Attributions

Rina Dechter's AcademicInfluence.com Rankings