Rina Dechter

发表

Decomposing an N-ary relation into a tree of binary relations

Rina Dechter, R. Dechter, 1987, PODS '87.

Processing disjunctions of temporal constraints

Rina Dechter, Eddie Schwalb, R. Dechter, 1996, Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96).

Active Tuples-based Scheme for Bounding Posterior Beliefs pdf

Rina Dechter, Bozhena Bidyuk, Emma Rollon, 2010, J. Artif. Intell. Res..

Learning While Searching in Constraint-Satisfaction-Problems

Rina Dechter, R. Dechter, 1986, AAAI.

Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics

Rina Dechter, Alexander T. Ihler, William Lam, 2014, SOCS.

Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms

Rina Dechter, 2013, Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms.

Guest Editorial

Rina Dechter, R. Dechter, 2004, Constraints.

Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results

Rina Dechter, Radu Marinescu, Junkyu Lee, 2014, AAAI Workshop: Statistical Relational Artificial Intelligence.

chapter 8 – Advanced Consistency Methods

Rina Dechter, R. Dechter, 2003 .

A New Algorithm for Sampling CSP Solutions Uniformly at Random

Vibhav Gogate, Rina Dechter, 2006, CP.

The Personal Travel Assistant (PTA): Measuring the Dynamics of Human Travel Behavior

Will Recker, Rina Dechter, James E. Marca, 2010 .

chapter 13 – Constraint Optimization

Rina Dechter, R. Dechter, 2003 .

Importance sampling-based estimation over AND/OR search spaces for graphical models

Vibhav Gogate, Rina Dechter, R. Dechter, 2012, Artif. Intell..

Learning structure from data: a survey

Rina Dechter, Judea Pearl, 1989, COLT '89.

chapter 5 – General Search Strategies: Look-Ahead

Rina Dechter, R. Dechter, 2003 .

On the minimality and global consistency of row-convex constraint networks

Peter van Beek, Rina Dechter, R. Dechter, 1995, JACM.

Sampling-based lower bounds for counting queries

Vibhav Gogate, Rina Dechter, R. Dechter, 2011, Intelligenza Artificiale.

Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs

Enrico Pontelli, Rina Dechter, Ferdinando Fioretto, 2016, Constraints.

A general scheme for automatic generation of search heuristics from specification dependencies

Rina Dechter, Kalev Kask, R. Dechter, 2001, Artif. Intell..

Studies in Solution Sampling

Vibhav Gogate, Rina Dechter, 2008, AAAI.

On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds

Javier Larrosa, Rina Dechter, William Lam, 2016, ECAI.

AND/OR Branch-and-Bound for Graphical Models

Rina Dechter, Radu Marinescu, R. Dechter, 2005, IJCAI.

Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units

Rina Dechter, Daniel Frost, R. Dechter, 1998, CP.

Probabilistic Inference Modulo Theories

Ciaran O'Reilly, Vibhav Gogate, Rina Dechter, 2016, IJCAI.

chapter 10 – Hybrids of Search and Inference: Time-Space Trade-Offs

Rina Dechter, R. Dechter, 2003 .

Bounding Search Space Size via (Hyper)tree Decompositions

Lars Otten, Rina Dechter, 2008, UAI.

A Scheme for Approximating Probabilistic Inference pdf

Rina Dechter, Irina Rish, R. Dechter, 1997, UAI.

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems

Javier Larrosa, Rina Dechter, R. Dechter, 2003, Constraints.

AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Rina Dechter, Radu Marinescu, R. Dechter, 2009, Artif. Intell..

Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms

Rina Dechter, Alexander T. Ihler, Qi Lou, 2019, AAAI.

Improving Bound Propagation

Rina Dechter, Bozhena Bidyuk, R. Dechter, 2006, ECAI.

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models

Lars Otten, Rina Dechter, 2012, UAI.

Approximate Solution Sampling (and Counting) on AND/OR Spaces

Vibhav Gogate, Rina Dechter, 2008, CP.

Weighted heuristic anytime search: new schemes for optimization over graphical models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2015, Annals of Mathematics and Artificial Intelligence.

Propositional semantics for disjunctive logic programs

Rina Dechter, Rachel Ben-Eliyahu-Zohary, R. Dechter, 1994, Annals of Mathematics and Artificial Intelligence.

On Finding Minimal w-cutset pdf

Rina Dechter, Bozhena Bidyuk, 2004, UAI.

Processing Probabilistic and Deterministic Graphical Models

Rina Dechter, R. Dechter, 2013 .

Mini-buckets: A general scheme for bounded inference

Rina Dechter, Irina Rish, R. Dechter, 2003, JACM.

Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming

Rina Dechter, R. Dechter, 2000 .

Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

Rina Dechter, Radu Marinescu, 2006, ECAI.

Best-First AND/OR Search for Most Probable Explanations

Rina Dechter, Radu Marinescu, 2007, UAI.

Empirical evaluation of diagnosis as optimization in constraint networks

Rina Dechter, Yousri El Fattah, 1992 .

BEEM : Bucket Elimination with External Memory pdf

Andrew Gelfand, Rina Dechter, Kalev Kask, 2010, UAI.

Dead-End Driven Learning

Rina Dechter, Daniel Frost, R. Dechter, 1994, AAAI.

Join Graph Decomposition Bounds for Influence Diagrams

Rina Dechter, Alexander T. Ihler, Junkyu Lee, 2018, UAI.

Hybrid Processing of Beliefs and Constraints pdf

Rina Dechter, David Larkin, R. Dechter, 2001, UAI.

Topological parameters for time-space tradeoff

Rina Dechter, Yousri El Fattah, R. Dechter, 1996, Artif. Intell..

Tree-Clustering Schemes for Constraint-Processing

Rina Dechter, Judea Pearl, J. Pearl, 1988, AAAI.

Temporal Reasoning with Constraints on Fluents and Events

Rina Dechter, Eddie Schwalb, Kalev Kask, 1994, AAAI.

Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)

Rina Dechter, Robert Mateescu, R. Dechter, 2006, CP.

Tree approximation for belief updating

Rina Dechter, Robert Mateescu, Kalev Kask, 2002, AAAI/IAAI.

Self-Stabilizing Distributed Constraint Satisfaction

Shmuel Katz, Rina Dechter, Zeev Collin, 1999, Chic. J. Theor. Comput. Sci..

The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting

Rina Dechter, Robert Mateescu, R. Dechter, 2004, CP.

On the Power of Belief Propagation: A Constraint Propagation Perspective

Rina Dechter, Robert Mateescu, Bozhena Bidyuk, 2010 .

Belief Maintenance in Dynamic Constraint Networks

Rina Dechter, Avi Dechter, R. Dechter, 1988, AAAI.

Finite-sample Bounds for Marginal MAP

Rina Dechter, Alexander T. Ihler, Qi Lou, 2018, UAI.

On the Practical Significance of Hypertree vs. TreeWidth

Lars Otten, Rina Dechter, Radu Marinescu, 2008, ECAI.

A Simple Insight into Iterative Belief Propagation's Success

Rina Dechter, Robert Mateescu, 2003, UAI.

Proceedings of the Seventh International Workshop on Preferences and Soft Constraints

Carmel Domshlak, Martin C. Cooper, Simon de Givry, 2005 .

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems

Lars Otten, Rina Dechter, R. Dechter, 2008, CP.

AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems

Rina Dechter, Radu Marinescu, 2006, CPAIOR.

A distributed solution to the network consistency problem

Rina Dechter, Zeev Collin, R. Dechter, 1991 .

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems

Rina Dechter, Radu Marinescu, 2005, CP.

Identifying Independencies in Causal Graphs with Feedback pdf

Rina Dechter, Judea Pearl, J. Pearl, 1996, UAI.

Propositional semantics for default logic

Rina Dechter, Rachel Ben-Eliyahu, 1992 .

Diagnosing Tree-Decomposable Circuits

Rina Dechter, Yousri El Fattah, 1995, IJCAI.

Evaluating partition strategies for mini-bucket elimination

Rina Dechter, Emma Rollon, 2010, ISAIM.

Local and Global Relational Consistency

Peter van Beek, Rina Dechter, R. Dechter, 1995, Theor. Comput. Sci..

Approximation Methods for Inference and Learning in Belief Networks: Progress and Future Directions

Rina Dechter, Michael J. Pazzan, 1997 .

Bucket elimination: A unifying framework for probabilistic inference

Rina Dechter, R. Dechter, 1996, UAI.

Tree Decomposition with Applications to Constraint Processing

Rina Dechter, Judea Pearl, Itay Meiri, 1990, AAAI.

AND/OR search spaces for graphical models

Rina Dechter, Robert Mateescu, R. Dechter, 2007, Artif. Intell..

AND/OR Importance Sampling pdf

Vibhav Gogate, Rina Dechter, 2008, UAI.

An Anytime Scheme for Bounding Posterior Beliefs

Rina Dechter, Bozhena Bidyuk, R. Dechter, 2006, AAAI.

Directional Resolution: The Davis-Putnam Procedure, Revisited

Rina Dechter, Irina Rish, R. Dechter, 1994, KR.

STLS: Cycle-Cutset-Driven Local Search For MPE

Rina Dechter, Alon Milchgrub, 2014, SOCS.

Preface: the AAAI-02 conference

Rina Dechter, Michael Kearns, Rich Sutton, 2002, AAAI Conference on Artificial Intelligence.

Improving Connectionist Energy Minimization

Gadi Pinkas, Rina Dechter, 1995, J. Artif. Intell. Res..

A New Perspective on Algorithms for Optimizing Policies under Uncertainty

Rina Dechter, R. Dechter, 2000, AIPS.

Uncovering Trees in Constraint Networks

Rina Dechter, Judea Pearl, Itay Meiri, 1996, Artif. Intell..

Constraint tightness and looseness versus local and global consistency

Peter van Beek, Rina Dechter, R. Dechter, 1997, JACM.

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference pdf

Rina Dechter, R. Dechter, 2013, ArXiv.

From Exact to Anytime Solutions for Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2016, AAAI.

Counting the Optimal Solutions in Graphical Models

Rina Dechter, Radu Marinescu, 2019, NeurIPS.

On the Expressiveness of Networks with Hidden Variables

Rina Dechter, R. Dechter, 1990, AAAI.

Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models

Andrew Gelfand, Lars Otten, Rina Dechter, 2011, AAAI.

Heuristic AND/OR Search for Solving Influence Diagram

Rina Dechter, Radu Marinescu, Junkyu Lee, 2020, SOCS.

Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation

Rina Dechter, William Lam, Kalev Kask, 2015, SOCS.

Temporal Constraint Networks

Rina Dechter, Judea Pearl, Itay Meiri, 1989, Artif. Intell..

Look-Ahead with Mini-Bucket Heuristics for MPE

Javier Larrosa, Rina Dechter, William Lam, 2016, AAAI.

An Anytime Approximation For Optimizing Policies Under Uncertainty

Rina Dechter, R. Dechter, 2000 .

Processing Temporal Constraint Networks

Rina Dechter, Eddie Schwalb, R. Dechter, 2008 .

Simple distributed algorithms for the cycle cutset problem

Rina Dechter, Arun K. Jagota, R. Dechter, 1997, SAC '97.

Look-Ahead Value Ordering for Constraint Satisfaction Problems

Rina Dechter, Daniel Frost, R. Dechter, 1995, IJCAI.

Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall

Rina Dechter, Alexander T. Ihler, Junkyu Lee, 2018, AAAI Workshops.

Join-Graph Propagation Algorithms

Vibhav Gogate, Rina Dechter, Robert Mateescu, 2010, J. Artif. Intell. Res..

Eighteenth national conference on Artificial intelligence

Rina Dechter, Rich Sutton, Michael J. Kearns, 2002 .

Counting-Based Look-Ahead Schemes for Constraint Satisfaction

Vibhav Gogate, Rina Dechter, Kalev Kask, 2004, CP.

Network-Based Heuristics for Constraint-Satisfaction Problems

Rina Dechter, Judea Pearl, J. Pearl, 1987, Artif. Intell..

Coping With Disjunctions in Temporal Constraint Satisfaction Problems

Rina Dechter, Eddie Schwalb, R. Dechter, 1993, AAAI.

Stopping Rules for Randomized Greedy Triangulation Schemes

Andrew Gelfand, Rina Dechter, Kalev Kask, 2011, AAAI.

Toward parallel search for optimization in graphical models

Lars Otten, Rina Dechter, 2010, ISAIM.

Generalized best-first search strategies and the optimality of A*

Rina Dechter, Judea Pearl, J. Pearl, 1985, JACM.

Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006) pdf

Thomas S. Richardson, Rina Dechter, 2012, ArXiv.

Local and Global Relational Consistency

Peter van Beek, Rina Dechter, R. Dechter, 1995, Theor. Comput. Sci..

Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space

Rina Dechter, Robert Mateescu, R. Dechter, 2004, UAI.

Pushing Forward Marginal MAP with Best-First Search

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2015, IJCAI.

Scaling Up AND/OR Abstraction Sampling

Rina Dechter, Alexander T. Ihler, Kalev Kask, 2020, IJCAI.

Evaluating probabilistic reasoning systems

Rina Dechter, Adnan Darwiche, 2008, BMA.

Predicting the Size of Depth-First Branch and Bound Search Trees

Lars Otten, Rina Dechter, Levi Lelis, 2013, IJCAI.

Generating random solutions for constraint satisfaction problems

Rina Dechter, Kalev Kask, Eyal Bin, 2002, AAAI/IAAI.

The Relationship Between AND/OR Search and Variable Elimination pdf

Rina Dechter, Robert Mateescu, 2005, UAI.

The optimality of A

Rina Dechter, Judea Pearl, J. Pearl, 1988 .

Stochastic Anytime Search for Bounding Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2018, IJCAI.

Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints pdf

Vibhav Gogate, Rina Dechter, 2005, UAI.

Best-First AND/OR Search for 0/1 Integer Programming

Rina Dechter, Radu Marinescu, 2007, CPAIOR.

An Improved Connectionist Activation Function for Energy Minimization

Gadi Pinkas, Rina Dechter, 1992, AAAI.

Removing Redundancies in Constraint Networks

Rina Dechter, Avi Dechter, R. Dechter, 1987, AAAI.

Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition

Rina Dechter, R. Dechter, 1990, Artif. Intell..

Constraint Directed Reasoning

Rina Dechter, R. Dechter, 1988 .

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models

Rina Dechter, Robert Mateescu, Radu Marinescu, 2008, J. Artif. Intell. Res..

Tree Clustering for Constraint Networks

Rina Dechter, Judea Pearl, J. Pearl, 1989, Artif. Intell..

chapter 6 – General Search Strategies: Look-Back

Rina Dechter, R. Dechter, 2003 .

chapter 7 – Stochastic Greedy Local Search

Rina Dechter, R. Dechter, 2003 .

Resolution versus Search: Two Strategies for SAT

Rina Dechter, Irina Rish, R. Dechter, 2000, Journal of Automated Reasoning.

Approximation algorithms for graphical models

Rina Dechter, Kalev Kask, 2001 .

THEOPTI TYOFA'RMSITED'

Rina Dechter, Judea Pearl, 1983 .

Human Resources Test and Evaluation System (HRTES). Volume 1. Comprehensive Handbook

Rina Dechter, Mark S. Sanders, Jonathan D Kaplan, 1984 .

Default Logic, Propositional Logic, and Constraints

Rina Dechter, Rachel Ben-Eliyahu-Zohary, R. Dechter, 1991, AAAI.

Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models

Rina Dechter, Emma Rollon, Natalia Flerova, 2011, GKR.

Evaluating the impact of AND/OR search on 0-1 integer linear programming

Rina Dechter, Radu Marinescu, R. Dechter, 2009, Constraints.

Modeling Transportation Routines using Hybrid Dynamic Mixed Networks pdf

Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, 2005, UAI.

Memory Intensive Branch-and-Bound Search for Graphical Models

Rina Dechter, Radu Marinescu, 2006, AAAI.

A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees

Lars Otten, Mark Silberstein, Rina Dechter, 2013, Bioinform..

Temporal reasoning with constraints

Rina Dechter, Edward Moshe Schwalb, R. Dechter, 1998 .

Systematic vs. Non-systematic Algorithms for Solving the MPE Task pdf

Rina Dechter, Radu Marinescu, Kalev Kask, 2003, UAI.

Robust Solutions in Unstable Optimization Problems

Francesca Rossi, Rina Dechter, Maria Silvia Pini, 2008, CSCLP.

Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing

Lars Otten, Rina Dechter, 2011, Pacific Symposium on Biocomputing.

Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP

Rina Dechter, Alexander T. Ihler, Qi Lou, 2018, AAAI.

The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation

Rina Dechter, Judea Pearl, J. Pearl, 1985, IJCAI.

Backjump-based backtracking for constraint satisfaction problems

Rina Dechter, Daniel Frost, R. Dechter, 2002, Artif. Intell..

SampleSearch: A Scheme that Searches for Consistent Samples

Vibhav Gogate, Rina Dechter, 2007, AISTATS.

The Optimality of A* Revisited

Rina Dechter, Judea Pearl, 1983, AAAI.

Dynamic Importance Sampling for Anytime Bounds of the Partition Function

Rina Dechter, Alexander T. Ihler, Qi Lou, 2017, NIPS.

Structure Identification in Relational Data

Rina Dechter, Judea Pearl, J. Pearl, 1992, Artif. Intell..

New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence

Rina Dechter, Emma Rollon, 2010, AAAI.

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding pdf

Rina Dechter, Kalev Kask, Irina Rish, 1998, UAI.

A Weighted Mini-Bucket Bound for Solving Influence Diagram

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2019, UAI.

Structure-Driven Algorithms for Truth Maintenance

Rina Dechter, Avi Dechter, R. Dechter, 1996, Artif. Intell..

Working notes of the 1991 spring symposium on constraint-based reasoning

Rina Dechter, R. Dechter, 1991 .

Cycle-Cutset Sampling for Bayesian Networks

Rina Dechter, Bozhena Bidyuk, 2003, Canadian Conference on AI.

Constraint processing incorporating, back jumping, learning, and cutset-decomposition

Rina Dechter, R. Dechter, 1988, [1988] Proceedings. The Fourth Conference on Artificial Intelligence Applications.

Maintenance scheduling problems as benchmarks for constraint algorithms

Rina Dechter, Daniel Frost, R. Dechter, 1999, Annals of Mathematics and Artificial Intelligence.

Anytime Recursive Best-First Search for Bounding Marginal MAP

Akihiro Kishimoto, Adi Botea, Rina Dechter, 2019, AAAI.

Advances in Distributed Branch and Bound

Lars Otten, Rina Dechter, 2012, ECAI.

On computing minimal models

Rina Dechter, Rachel Ben-Eliyahu-Zohary, R. Dechter, 1993, Annals of Mathematics and Artificial Intelligence.

AND/OR Multi-valued Decision Diagrams for Constraint Networks

Rina Dechter, Robert Mateescu, R. Dechter, 2008, Concurrency, Graphs and Models.

Broadcast Communications and Distributed Algorithms

Leonard Kleinrock, Rina Dechter, R. Dechter, 1986, IEEE Transactions on Computers.

Residual-Guided Look-Ahead in AND/OR Search for Graphical Models

Javier Larrosa, Rina Dechter, William Lam, 2017, J. Artif. Intell. Res..

Iterative Join-Graph Propagation pdf

Rina Dechter, Robert Mateescu, Kalev Kask, 2002, UAI.

Mini-bucket Elimination with Moment Matching

Lars Otten, Rina Dechter, Alexander T. Ihler, 2011 .

AND/OR Cutset Conditioning

Rina Dechter, Robert Mateescu, R. Dechter, 2005, IJCAI.

Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning

Rina Dechter, R. Dechter, 1997, IJCAI.

Cutset Sampling for Bayesian Networks

Rina Dechter, Bozhena Bidyuk, R. Dechter, 2011, J. Artif. Intell. Res..

chapter 3 – Consistency-Enforcing and Constraint Propagation

Rina Dechter, R. Dechter, 2003 .

Mini-buckets: a general scheme for approximating inference

Rina Dechter, Irina Rish, R. Dechter, 2002 .

AND/OR Search for Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2014, UAI.

A problem simplification approach that generates heuristics for constraint-satisfaction problems

Rina Dechter, Judea Pearl, J. Pearl, 1988 .

Value iteration and policy iteration algorithms for Markov decision problem

Rina Dechter, Irina Rish, Elena Pashenkova, 1996 .

AND/OR Multi-valued Decision Diagrams for Constraint Optimization

Rina Dechter, Robert Mateescu, Radu Marinescu, 2007, CP.

Default Reasoning Using Classical Logic

Rina Dechter, Rachel Ben-Eliyahu-Zohary, R. Dechter, 1996, Artif. Intell..

Subproblem ordering heuristics for AND/OR best-first search

Javier Larrosa, Rina Dechter, William Lam, 2018, J. Comput. Syst. Sci..

Anytime AND/OR Best-First Search for Optimization in Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2013 .

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models pdf

Rina Dechter, Robert Mateescu, R. Dechter, 2007, UAI.

In Search of the Best Constraint Satisfaction Search

Rina Dechter, Daniel Frost, R. Dechter, 1994, AAAI.

Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality pdf

Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, 2007, UAI.

Bucket Elimination: A Unifying Framework for Reasoning

Rina Dechter, R. Dechter, 1999, Artif. Intell..

Branch and Bound with Mini-Bucket Heuristics

Rina Dechter, Kalev Kask, R. Dechter, 1999, IJCAI.

AND/OR Search Spaces and the Semantic Width of Constraint Networks

Rina Dechter, Robert Mateescu, 2005, CP.

Probabilistic Analysis of the Complexity of A*

Rina Dechter, Judea Pearl, Nam Huyn, 1980, Artif. Intell..

chapter 2 – Constraint Networks

Rina Dechter, R. Dechter, 2003 .

Bayesian Inference in the Presence of Determinism

Rina Dechter, David Larkin, R. Dechter, 2003, AISTATS.

A Graph-Based Method for Improving GSAT

Rina Dechter, Kalev Kask, R. Dechter, 1996, AAAI/IAAI, Vol. 1.

Best-First AND/OR Search for Graphical Models

Rina Dechter, Radu Marinescu, 2007, AAAI.

chapter 12 – Temporal Constraint Networks

Rina Dechter, R. Dechter, 2003 .

Anytime Anyspace AND/OR Search for Bounding the Partition Function

Rina Dechter, Alexander T. Ihler, Qi Lou, 2017, AAAI.

AND/OR Branch-and-Bound on a Computational Grid

Lars Otten, Rina Dechter, R. Dechter, 2017, J. Artif. Intell. Res..

On finding minimal w-cutset problem

Rina Dechter, Bozhena Bidyuk, 2004, UAI 2004.

Decomposing a Relation into a Tree of Binary Relations

Rina Dechter, 1990, J. Comput. Syst. Sci..

Processing Disjunctions in Temporal Constraint Networks

Rina Dechter, Eddie Schwalb, R. Dechter, 1997, Artif. Intell..

On the Feasibility of Distributed Constraint Satisfaction

Shmuel Katz, Rina Dechter, Zeev Collin, 1991, IJCAI.

Heuristic search in artificial intelligence

Richard E. Korf, Weixiong Zhang, Rina Dechter, 2001, Artif. Intell..

Evaluating Weighted DFS Branch and Bound over Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2014, SOCS.

To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract)

Rina Dechter, Irina Rish, R. Dechter, 1996, CP.

Join-graph based cost-shifting schemes pdf

Lars Otten, Rina Dechter, Alexander T. Ihler, 2012, UAI.

Artificial intelligence journal special issue on heuristic search

Richard E. Korf, Weixiong Zhang, Rina Dechter, 1999 .

A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees

Lars Otten, Mark Silberstein, Rina Dechter, 2013, Bioinform..

Approximate Counting by Sampling the Backtrack-free Search Space

Vibhav Gogate, Rina Dechter, 2007, AAAI.

Unifying tree decompositions for reasoning in graphical models

Javier Larrosa, Rina Dechter, Kalev Kask, 2005, Artif. Intell..

Program committee

Henry A. Kautz, Vladimir Lifschitz, Rina Dechter, 2003, 2010 Sixth International Conference on Natural Computation.

A General Scheme for Multiple Lower Bound Computation in Constraint Optimization

Javier Larrosa, Rina Dechter, Kalev Kask, 2001, CP.

Network-based heuristics for constraint satisfaction problems

Rina Dechter, Judea Pearl, J. Pearl, 1988 .

Searching for the M Best Solutions in Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2016, J. Artif. Intell. Res..

Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models

Javier Larrosa, Rina Dechter, Emma Rollon, 2016, IJCAI.

Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints

Rina Dechter, 2004, Constraints.

Stochastic local search for Bayesian network

Rina Dechter, Kalev Kask, R. Dechter, 1999, AISTATS.

Looking at Full Looking Ahead

Rina Dechter, Daniel Frost, R. Dechter, 1996, CP.

Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract)

Lars Otten, Rina Dechter, 2014, CP.

An Empirical Study of w-Cutset Sampling for Bayesian Networks pdf

Rina Dechter, Bozhena Bidyuk, 2003, UAI.

Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems

Rina Dechter, Itay Meiri, R. Dechter, 1994, Artif. Intell..

New Look-Ahead Schemes for Constraint Satisfaction

Vibhav Gogate, Rina Dechter, Kalev Kask, 2004, ISAIM.

Search Algorithms for m Best Solutions for Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2012, AAAI.

Inference in inheritance networks using propositional logic and constraint networks techniques

Rina Dechter, Rachel Ben-Eliyahu, 1992 .

An Implementation of the Combinatorial Auction Problem in ECLiPSe

Rina Dechter, Robert Menke, 2000, AAAI/IAAI.

Constraints and Probabilistic Networks: A Look At The Interface

Rina Dechter, 2004, LPNMR.

Semiring-Based Mini-Bucket Partitioning Schemes

Javier Larrosa, Rina Dechter, Emma Rollon, 2013, IJCAI.

Finding All Solutions if You can Find One

Alon Itai, Rina Dechter, 1992 .

Weighted Best First Search for Graphical Models

Rina Dechter, Radu Marinescu, Natalia Flerova, 2014, ISAIM.

A Complete Anytime Algorithm for Treewidth

Vibhav Gogate, Rina Dechter, R. Dechter, 2004, UAI.

Anytime AND/OR depth-first search for combinatorial optimization

Lars Otten, Rina Dechter, R. Dechter, 2011, AI Commun..

Directed Constraint Networks: A Relational Framework for Causal Modeling

Rina Dechter, Judea Pearl, J. Pearl, 1991, IJCAI.

Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models

Lars Otten, Rina Dechter, Levi Lelis, 2014, CP.

Tractable Structures for Constraint Satisfaction Problems

Rina Dechter, R. Dechter, 2006, Handbook of Constraint Programming.

On Combining Graph-based Variance Reduction schemes

Vibhav Gogate, Rina Dechter, 2010, AISTATS.

chapter 4 – Directional Consistency

Rina Dechter, R. Dechter, 2003 .

Mini-Bucket Heuristics for Improved Search pdf

Rina Dechter, Kalev Kask, R. Dechter, 1999, UAI.

Bucket Elimination: a Unifying Framework for Structure-driven Inference

Rina Dechter, R. Dechter, 2008 .

Reasoning with Graphical Models

Rina Dechter, R. Dechter, 2011 .

Processing Boolean queries over Belief networks

Padhraic Smyth, Rina Dechter, 2000 .

A Comparison of Time-Space Schemes for Graphical Models

Rina Dechter, Robert Mateescu, 2007, IJCAI.

Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems

Rina Dechter, Itay Meiri, R. Dechter, 1989, IJCAI.

Caching in Context-Minimal OR Spaces

Lars Otten, Rina Dechter, Levi Lelis, 2015, SOCS.

Mixed deterministic and probabilistic networks

Rina Dechter, Robert Mateescu, R. Dechter, 2008, Annals of Mathematics and Artificial Intelligence.

From Local to Global Consistency

Rina Dechter, R. Dechter, 1990, Artif. Intell..

Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results

Rina Dechter, Radu Marinescu, Junkyu Lee, 2016, ISAIM.

Principles and Practice of Constraint Programming – CP 2000

Rina Dechter, R. Dechter, 2001, Lecture Notes in Computer Science.

Bucket elimination: a unifying framework for processing hard and soft constraints

Rina Dechter, 1996, CSUR.

On the Dual Representation of Non-binary Semiring-based CSPs

Javier Larrosa, Rina Dechter, R. Dechter, 2000 .

Anytime Best+Depth-First Search for Bounding Marginal MAP

Rina Dechter, Alexander T. Ihler, Radu Marinescu, 2017, AAAI.

SampleSearch: Importance sampling in presence of determinism

Vibhav Gogate, Rina Dechter, R. Dechter, 2011, Artif. Intell..

Dynamic Combination of Search and Variable Elimination in CSP and Max-CSP

Javier Larrosa, Rina Dechter, R. Dechter, 2003 .

chapter 14 – Probabilistic Networks

Rina Dechter, R. Dechter, 2003 .

On the Greedy Solution of Ordering Problems

Rina Dechter, Avi Dechter, 1989, INFORMS J. Comput..

Cutset Sampling with Likelihood Weighting pdf

Rina Dechter, Bozhena Bidyuk, R. Dechter, 2006, UAI.

Constraint Processing

Rina Dechter, R. Dechter, 1995, Lecture Notes in Computer Science.

Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition

Rina Dechter, R. Dechter, 2019, Reasoning with Probabilistic and Deterministic Graphical Models.

Constraint Tightness versus Global Consistency

Peter van Beek, Rina Dechter, R. Dechter, 1994, KR.

GSAT and Local Consistency

Rina Dechter, Kalev Kask, 1995, IJCAI.

Memory intensive AND/OR search for combinatorial optimization in graphical models

Rina Dechter, Radu Marinescu, 2009, Artif. Intell..

An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits pdf

Rina Dechter, Yousri El Fattah, R. Dechter, 1996, UAI.

Systematic Versus Stochastic Constraint Satisfaction

Bart Selman, Eugene C. Freuder, Matthew L. Ginsberg, 1995, IJCAI.

Deep Bucket Elimination

Pierre Baldi, Yadong Lu, Rina Dechter, 2021, IJCAI.

A New Bounding Scheme for Influence Diagrams

Rina Dechter, Radu Marinescu, Junkyu Lee, 2021, AAAI.

Approximating Spatial Evolutionary Games using Bayesian Networks

Rina Dechter, Dana Nau, Vincent Hsiao, 2021, AAMAS.

Submodel Decomposition Bounds for Influence Diagrams

Rina Dechter, Radu Marinescu, Junkyu Lee, 2021, AAAI.

An Improved Activation Function for Energy Minimization

Gadi Pinkas, Rina Dechter, 1992 .

chapter 9 – Tree Decomposition Methods

Rina Dechter, R. Dechter, 2003 .

Sampling algorithms for probabilistic graphical models with determinism

Vibhav Gogate, Rina Dechter, R. Dechter, 2009 .

it in Temporal Constraint

Rina Dechter, Eddie Schwalb, R. Dechter, 1993 .

Maximum Likelihood Haplotyping through Parallelized Search on a Grid of Computers

Lars Otten, Mark Silberstein, Rina Dechter, 2009 .

Benchmark on DAOOPT and GUROBI with the PASCAL 2 Inference Challenge Problems

Rina Dechter, William Lam, Junkyu Lee, 2013 .

A Simple Application of Sampling Importance Resampling ( SIR ) for Solution Sampling

Vibhav Gogate, Rina Dechter, R. Dechter, 2007 .

Advances in AND / OR Branch-and-Bound Search for Constraint Optimization

Rina Dechter, Radu Marinescu, R. Dechter, 2005 .

Load Balancing for Parallel Branch and Bound ⋆

Lars Otten, Rina Dechter, 2010 .

Approximate Solution Sampling ( and Counting ) on AND / OR search space

Vibhav Gogate, Rina Dechter, R. Dechter, 2008 .

The Relationship Between AND / OR Search Spaces and Variable Elimination

Rina Dechter, Robert Mateescu, R. Dechter, 2005 .

Exploiting graph cutsets for sampling-based approximations in bayesian networks

Rina Dechter, Bozhena Bidyuk, R. Dechter, 2006 .

And/or search strategies for combinatorial optimization in graphical models

Rina Dechter, Radu Marinescu, R. Dechter, 2008 .

Temporal Constraints in Planning : Free or not Free ?

Rina Dechter, Itay Meiri, R. Dechter, 1995 .

Studies in the use and generation of heuristics (greedy algorithms)

Rina Dechter, 1985 .

Artificial Intelligence Techniques

Alan Bundy, Ian Frank, Alan Smaill, 1997, Springer Berlin Heidelberg.