Rina Dechter

According to our database1, Rina Dechter authored at least 202 papers between 1980 and 2019.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2013, "For contributions to the algorithmic foundations of automated reasoning with constraint-based and probabilistic information.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition
Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, 2019

A Weighted Mini-Bucket Bound for Solving Influence Diagram.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Counting the Optimal Solutions in Graphical Models.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Anytime Recursive Best-First Search for Bounding Marginal MAP.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Subproblem ordering heuristics for AND/OR best-first search.
J. Comput. Syst. Sci., 2018

AND/OR Search for Marginal MAP.
J. Artif. Intell. Res., 2018

Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs.
Constraints, 2018

Finite-sample Bounds for Marginal MAP.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Join Graph Decomposition Bounds for Influence Diagrams.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Abstraction Sampling in Graphical Models.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Stochastic Anytime Search for Bounding Marginal MAP.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall.
Proceedings of the Workshops of the The Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
AND/OR Branch-and-Bound on a Computational Grid.
J. Artif. Intell. Res., 2017

Residual-Guided Look-Ahead in AND/OR Search for Graphical Models.
J. Artif. Intell. Res., 2017

Weighted heuristic anytime search: new schemes for optimization over graphical models.
Ann. Math. Artif. Intell., 2017

Dynamic Importance Sampling for Anytime Bounds of the Partition Function.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Anytime Anyspace AND/OR Search for Bounding the Partition Function.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Anytime Best+Depth-First Search for Bounding Marginal MAP.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Searching for the M Best Solutions in Graphical Models.
J. Artif. Intell. Res., 2016

Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Probabilistic Inference Modulo Theories.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

From Exact to Anytime Solutions for Marginal MAP.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Look-Ahead with Mini-Bucket Heuristics for MPE.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Caching in Context-Minimal OR Spaces.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Pushing Forward Marginal MAP with Best-First Search.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
AND/OR Search for Marginal MAP.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

STLS: Cycle-Cutset-Driven Local Search For MPE.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Evaluating Weighted DFS Branch and Bound over Graphical Models.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Weighted Best First Search for Graphical Models.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014

Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results.
Proceedings of the Statistical Relational Artificial Intelligence, 2014

2013
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, 2013

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference
CoRR, 2013

A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees.
Bioinformatics, 2013

Semiring-Based Mini-Bucket Partitioning Schemes.
Proceedings of the IJCAI 2013, 2013

Predicting the Size of Depth-First Branch and Bound Search Trees.
Proceedings of the IJCAI 2013, 2013

2012
Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006)
CoRR, 2012

Anytime AND/OR depth-first search for combinatorial optimization.
AI Commun., 2012

Importance sampling-based estimation over AND/OR search spaces for graphical models.
Artif. Intell., 2012

A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Join-graph based cost-shifting schemes.
Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, 2012

Advances in Distributed Branch and Bound.
Proceedings of the ECAI 2012, 2012

Search Algorithms for m Best Solutions for Graphical Models.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Sampling-based lower bounds for counting queries.
Intelligenza Artificiale, 2011

SampleSearch: Importance sampling in presence of determinism.
Artif. Intell., 2011

Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing.
Proceedings of the Biocomputing 2011: Proceedings of the Pacific Symposium, 2011

Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models.
Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2011

Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Stopping Rules for Randomized Greedy Triangulation Schemes.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
On Combining Graph-based Variance Reduction schemes.
Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 2010

Join-Graph Propagation Algorithms.
J. Artif. Intell. Res., 2010

Active Tuples-based Scheme for Bounding Posterior Beliefs.
J. Artif. Intell. Res., 2010

Evaluating the impact of AND/OR search on 0-1 integer linear programming.
Constraints, 2010

BEEM : Bucket Elimination with External Memory.
Proceedings of the UAI 2010, 2010

Evaluating partition strategies for mini-bucket elimination.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2010

Toward parallel search for optimization in graphical models.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2010

New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Memory intensive AND/OR search for combinatorial optimization in graphical models.
Artif. Intell., 2009

AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.
Artif. Intell., 2009

2008
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models.
J. Artif. Intell. Res., 2008

Mixed deterministic and probabilistic networks.
Ann. Math. Artif. Intell., 2008

Bounding Search Space Size via (Hyper)tree Decompositions.
Proceedings of the UAI 2008, 2008

AND/OR Importance Sampling.
Proceedings of the UAI 2008, 2008

Evaluating probabilistic reasoning systems.
Proceedings of the Sixth UAI Bayesian Modelling Applications Workshop Helsinki, 2008

On the Practical Significance of Hypertree vs. TreeWidth.
Proceedings of the ECAI 2008, 2008

Robust Solutions in Unstable Optimization Problems.
Proceedings of the Recent Advances in Constraints, 2008

Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Approximate Solution Sampling (and Counting) on AND/OR Spaces.
Proceedings of the Principles and Practice of Constraint Programming, 2008

AND/OR Multi-valued Decision Diagrams for Constraint Networks.
Proceedings of the Concurrency, 2008

Studies in Solution Sampling.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
SampleSearch: A Scheme that Searches for Consistent Samples.
Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007

Cutset Sampling for Bayesian Networks.
J. Artif. Intell. Res., 2007

AND/OR search spaces for graphical models.
Artif. Intell., 2007

AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models.
Proceedings of the UAI 2007, 2007

Best-First AND/OR Search for Most Probable Explanations.
Proceedings of the UAI 2007, 2007

Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality.
Proceedings of the UAI 2007, 2007

A Comparison of Time-Space Schemes for Graphical Models.
Proceedings of the IJCAI 2007, 2007

Best-First AND/OR Search for 0/1 Integer Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

AND/OR Multi-valued Decision Diagrams for Constraint Optimization.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Best-First AND/OR Search for Graphical Models.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Approximate Counting by Sampling the Backtrack-free Search Space.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Tractable Structures for Constraint Satisfaction Problems.
Proceedings of the Handbook of Constraint Programming, 2006

Cutset Sampling with Likelihood Weighting.
Proceedings of the UAI '06, 2006

Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Improving Bound Propagation.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs).
Proceedings of the Principles and Practice of Constraint Programming, 2006

A New Algorithm for Sampling CSP Solutions Uniformly at Random.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Memory Intensive Branch-and-Bound Search for Graphical Models.
Proceedings of the Proceedings, 2006

An Anytime Scheme for Bounding Posterior Beliefs.
Proceedings of the Proceedings, 2006

2005
Unifying tree decompositions for reasoning in graphical models.
Artif. Intell., 2005

The Relationship Between AND/OR Search and Variable Elimination.
Proceedings of the UAI '05, 2005

Modeling Transportation Routines using Hybrid Dynamic Mixed Networks.
Proceedings of the UAI '05, 2005

Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints.
Proceedings of the UAI '05, 2005

AND/OR Cutset Conditioning.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

AND/OR Branch-and-Bound for Graphical Models.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

AND/OR Search Spaces and the Semantic Width of Constraint Networks.
Proceedings of the Principles and Practice of Constraint Programming, 2005

AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
A Complete Anytime Algorithm for Treewidth.
Proceedings of the UAI '04, 2004

Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space.
Proceedings of the UAI '04, 2004

On Finding Minimal w-cutset.
Proceedings of the UAI '04, 2004

Constraints and Probabilistic Networks: A Look At The Interface.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

New Look-Ahead Schemes for Constraint Satisfaction.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

Counting-Based Look-Ahead Schemes for Constraint Satisfaction.
Proceedings of the Principles and Practice of Constraint Programming, 2004

The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
Mini-buckets: A general scheme for bounded inference.
J. ACM, 2003

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems.
Constraints, 2003

Guest Editorial.
Constraints, 2003

Systematic vs. Non-systematic Algorithms for Solving the MPE Task.
Proceedings of the UAI '03, 2003

A Simple Insight into Iterative Belief Propagation's Success.
Proceedings of the UAI '03, 2003

An Empirical Study of w-Cutset Sampling for Bayesian Networks.
Proceedings of the UAI '03, 2003

Bayesian Inference in the Presence of Determinism.
Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics, 2003

Cycle-Cutset Sampling for Bayesian Networks.
Proceedings of the Advances in Artificial Intelligence, 2003

Constraint processing.
Elsevier Morgan Kaufmann, ISBN: 978-1-55860-890-0, 2003

2002
Backjump-based backtracking for constraint satisfaction problems.
Artif. Intell., 2002

Iterative Join-Graph Propagation.
Proceedings of the UAI '02, 2002

Tree Approximation for Belief Updating.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

Generating Random Solutions for Constraint Satisfaction Problems.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002

2001
Heuristic search in artificial intelligence.
Artif. Intell., 2001

A general scheme for automatic generation of search heuristics from specification dependencies.
Artif. Intell., 2001

Topological parameters for time-space tradeoff.
Artif. Intell., 2001

Hybrid Processing of Beliefs and Constraints.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001

A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
Resolution versus Search: Two Strategies for SAT.
J. Autom. Reasoning, 2000

A New Perspective on Algorithms for Optimizing Policies under Uncertainty.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

An Implementation of the Combinatorial Auction Problem in ECLiPSe.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Self-Stabilizing Distributed Constraint Satisfaction.
Chicago J. Theor. Comput. Sci., 1999

Maintenance scheduling problems as benchmarks for constraint algorithms.
Ann. Math. Artif. Intell., 1999

Bucket Elimination: A Unifying Framework for Reasoning.
Artif. Intell., 1999

Mini-Bucket Heuristics for Improved Search.
Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

Branch and Bound with Mini-Bucket Heuristics.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

Stochastic local search for Bayesian network.
Proceedings of the Seventh International Workshop on Artificial Intelligence and Statistics, 1999

1998
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding.
Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998

Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units.
Proceedings of the Principles and Practice of Constraint Programming, 1998

Bucket Elimination: A Unifying Framework for Probabilistic Inference.
Proceedings of the Learning in Graphical Models, 1998

1997
Local and Global Relational Consistency.
Theor. Comput. Sci., 1997

Constraint tightness and looseness versus local and global consistency.
J. ACM, 1997

Processing Disjunctions in Temporal Constraint Networks.
Artif. Intell., 1997

A Scheme for Approximating Probabilistic Inference.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

Simple distributed algorithms for the cycle cutset problem.
Proceedings of the 1997 ACM symposium on Applied Computing, 1997

Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

1996
Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints.
ACM Comput. Surv., 1996

On Computing Minimal Models.
Ann. Math. Artif. Intell., 1996

Uncovering Trees in Constraint Networks.
Artif. Intell., 1996

Structure-Driven Algorithms for Truth Maintenance.
Artif. Intell., 1996

Default Reasoning Using Classical Logic.
Artif. Intell., 1996

Identifying Independencies in Causal Graphs with Feedback.
Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits.
Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

Topological parameters for time-space tradeoff.
Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

Bucket elimination: A unifying framework for probabilistic inference.
Proceedings of the UAI '96: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence, 1996

Processing Disjunctions of Temporal Constraints.
Proceedings of the Third International Workshop on Temporal Representation and Reasoning, 1996

To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract).
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Looking at Full Looking Ahead.
Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

A Graph-Based Method for Improving GSAT.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Improving Connectionist Energy Minimization.
J. Artif. Intell. Res., 1995

On the Minimality and Decomposability of Row-Convex Constraint Networks.
J. ACM, 1995

GSAT and Local Consistency.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Look-Ahead Value Ordering for Constraint Satisfaction Problems.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Systematic Versus Stochastic Constraint Satisfaction.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Diagnosing Tree-Decomposable Circuits.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Propositional Semantics for Disjunctive Logic Programs.
Ann. Math. Artif. Intell., 1994

Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems.
Artif. Intell., 1994

Directional Resolution: The Davis-Putnam Procedure, Revisited.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Constraint Tightness versus Global Consistency.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

Temporal Reasoning with Constraints on Fluents and Events.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

In Search of the Best Constraint Satisfaction Search.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

Dead-End Driven Learning.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993
Coping With Disjunctions in Temporal Constraint Satisfaction Problems.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992
Structure Identification in Relational Data.
Artif. Intell., 1992

From Local to Global Consistency.
Artif. Intell., 1992

Propositional Sematics for Disjunctive Logic Programs.
Proceedings of the Logic Programming, 1992

An Improved Connectionist Activation Function for Energy Minimization.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Temporal Constraint Networks.
Artif. Intell., 1991

Directed Constraint Networks: A Relational Framework for Causal Modeling.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

On the Feasibility of Distributed Constraint Satisfaction.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Default Logic, Propositional Logic, and Constraints.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Decomposing a Relation into a Tree of Binary Relations.
J. Comput. Syst. Sci., 1990

Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition.
Artif. Intell., 1990

Tree Decomposition with Applications to Constraint Processing.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

On the Expressiveness of Networks with Hidden Variables.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1989
On the Greedy Solution of Ordering Problems.
INFORMS Journal on Computing, 1989

Tree Clustering for Constraint Networks.
Artif. Intell., 1989

Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Learning Structure from Data: A Survey.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
Tree-Clustering Schemes for Constraint-Processing.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

Belief Maintenance in Dynamic Constraint Networks.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987
Network-Based Heuristics for Constraint-Satisfaction Problems.
Artif. Intell., 1987

Decomposing an N-ary Relation into a Tree of Binary Relations.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Removing Redundancies in Constraint Networks.
Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986
Broadcast Communications and Distributed Algorithms.
IEEE Trans. Computers, 1986

Learning While Searching in Constraint-Satisfaction-Problems.
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986

1985
Generalized Best-First Search Strategies and the Optimality of A*
J. ACM, July, 1985

The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation.
Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1983
The Optimality of A* Revisited.
Proceedings of the National Conference on Artificial Intelligence, 1983

1980
Probabilistic Analysis of the Complexity of A*.
Artif. Intell., 1980


  Loading...