Rina Dechter - RankMe

263 papers A* 58A 67B 10C 1Misc 7Journal 98Unranked 15

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A Community-driven vision for a new Knowledge Resource for AI. CoRR Vinay K. Chaudhri, Chaitan Baru, Brandon Bennett, Mehul Bhatt, Darion Cassel, Anthony G. Cohn, Rina Dechter, Esra Erdem, David A. Ferrucci, Kenneth D. Forbus, Gregory Gelfond, Michael R. Genesereth, Andrew S. Gordon, Benjamin N. Grosof, Gopal Gupta, Jim Hendler, Sharat Israni, Tyler R. Josephson, Patrick C. Kyllonen, Yuliya Lierler, Vladimir Lifschitz, Clifton James McFate, Hande K. McGinty, Leora Morgenstern, Alessandro Oltramari, Praveen K. Paritosh, Dan Roth, Blake Shepard, Cogan Shimizu, Denny Vrandecic, Mark Whiting, Michael Witbrock
2025	J	`jnl`	A community-driven vision for a new knowledge resource for AI. AI Mag. Vinay K. Chaudhri, Chaitan Baru, Brandon Bennett, Mehul Bhatt, Darion Cassel, Anthony G. Cohn, Rina Dechter, Esra Erdem, David A. Ferrucci, Kenneth D. Forbus, Gregory Gelfond, Michael R. Genesereth, Andrew S. Gordon, Benjamin N. Grosof, Gopal Gupta, Jim Hendler, Sharat Israni, Tyler R. Josephson, Patrick C. Kyllonen, Yuliya Lierler, Vladimir Lifschitz, Clifton James McFate, Hande K. McGinty, Leora Morgenstern, Alessandro Oltramari, Praveen K. Paritosh, Dan Roth, Blake Shepard, Cogan Shimizu, Denny Vrandecic, Mark Whiting, Michael Witbrock
2025	A	`conf`	Graph-based Complexity for Causal Effect by Empirical Plug-in. AISTATS Rina Dechter, Anna Raichev, Jin Tian, Alexander Ihler
2024	A	`conf`	Estimating Causal Effects from Learned Causal Networks. ECAI Anna Raichev, Jin Tian, Alexander Ihler, Rina Dechter
2024	J	`jnl`	Estimating Causal Effects from Learned Causal Networks. CoRR Anna Raichev, Alexander Ihler, Jin Tian, Rina Dechter
2024	J	`jnl`	Graph-based Complexity for Causal Effect by Empirical Plug-in. CoRR Rina Dechter, Anna Raichev, Alexander Ihler, Jin Tian
2024	A	`conf`	Surrogate Bayesian Networks for Approximating Evolutionary Games. AISTATS Vincent Hsiao, Dana S. Nau, Bobak Pezeshki, Rina Dechter
2024	A	`conf`	Value-Based Abstraction Functions for Abstraction Sampling. UAI Bobak Pezeshki, Kalev Kask, Alexander Ihler, Rina Dechter
2023	J	`jnl`	Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO. CoRR Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter
2023	A	`conf`	Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. UAI Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter
2022	A	`conf`	AND/OR branch-and-bound for computational protein design optimizing K. UAI Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter
2022	A	`conf`	Fast Fourier Transform Reductions for Bayesian Network Inference. AISTATS Vincent Hsiao, Dana S. Nau, Rina Dechter
2022	A	`conf`	NeuroBE: Escalating neural network approximations of Bucket Elimination. UAI Sakshi Agarwal, Kalev Kask, Alexander Ihler, Rina Dechter
2022	—	`book`	Probabilistic and Causal Inference: The Works of Judea Pearl Probabilistic and Causal Inference Hector Geffner, Rina Dechter, Joseph Y. Halpern
2021	A*	`conf`	A New Bounding Scheme for Influence Diagrams. AAAI Radu Marinescu, Junkyu Lee, Rina Dechter
2021	A	`conf`	Approximating Spatial Evolutionary Games using Bayesian Networks. AAMAS Vincent Hsiao, Xinyue Pan, Dana S. Nau, Rina Dechter
2021	A*	`conf`	Deep Bucket Elimination. IJCAI Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter
2021	A*	`conf`	Submodel Decomposition Bounds for Influence Diagrams. AAAI Junkyu Lee, Radu Marinescu, Rina Dechter
2020	B	`conf`	Heuristic AND/OR Search for Solving Influence Diagram. SOCS Junkyu Lee, Radu Marinescu, Rina Dechter
2020	A*	`conf`	Scaling Up AND/OR Abstraction Sampling. IJCAI Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, Rina Dechter
2019	A	`conf`	A Weighted Mini-Bucket Bound for Solving Influence Diagram. UAI Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter
2019	A*	`conf`	Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler
2019	A*	`conf`	Counting the Optimal Solutions in Graphical Models. NeurIPS Radu Marinescu, Rina Dechter
2019	A*	`conf`	Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms. AAAI Qi Lou, Rina Dechter, Alexander Ihler
2019	—	`book`	Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition Reasoning with Probabilistic and Deterministic Graphical Models (2nd Ed.) Rina Dechter
2018	J	`jnl`	AND/OR Search for Marginal MAP. J. Artif. Intell. Res. Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander Ihler
2018	A	`conf`	Abstraction Sampling in Graphical Models. UAI Filjor Broka, Rina Dechter, Alexander Ihler, Kalev Kask
2018	J	`jnl`	Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs. Constraints An Int. J. Ferdinando Fioretto, Enrico Pontelli, William Yeoh, Rina Dechter
2018	A*	`conf`	Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP. AAAI Qi Lou, Rina Dechter, Alexander Ihler
2018	A	`conf`	Finite-sample Bounds for Marginal MAP. UAI Qi Lou, Rina Dechter, Alexander Ihler
2018	—	`conf`	Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. AAAI Workshops Junkyu Lee, Alexander Ihler, Rina Dechter
2018	A	`conf`	Join Graph Decomposition Bounds for Influence Diagrams. UAI Junkyu Lee, Alexander Ihler, Rina Dechter
2018	A*	`conf`	Stochastic Anytime Search for Bounding Marginal MAP. IJCAI Radu Marinescu, Rina Dechter, Alexander Ihler
2018	J	`jnl`	Subproblem ordering heuristics for AND/OR best-first search. J. Comput. Syst. Sci. William Lam, Kalev Kask, Javier Larrosa, Rina Dechter
2017	J	`jnl`	AND/OR Branch-and-Bound on a Computational Grid. J. Artif. Intell. Res. Lars Otten, Rina Dechter
2017	A*	`conf`	Anytime Anyspace AND/OR Search for Bounding the Partition Function. AAAI Qi Lou, Rina Dechter, Alexander Ihler
2017	A*	`conf`	Anytime Best+Depth-First Search for Bounding Marginal MAP. AAAI Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter
2017	—	`conf`	Dynamic Importance Sampling for Anytime Bounds of the Partition Function. NIPS Qi Lou, Rina Dechter, Alexander Ihler
2017	J	`jnl`	Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. J. Artif. Intell. Res. William Lam, Kalev Kask, Javier Larrosa, Rina Dechter
2017	J	`jnl`	Weighted heuristic anytime search: new schemes for optimization over graphical models. Ann. Math. Artif. Intell. Natalia Flerova, Radu Marinescu, Rina Dechter
2016	J	`jnl`	Accelerating Exact and Approximate Inference for (Distributed) Discrete Optimization with GPUs. CoRR Ferdinando Fioretto, Enrico Pontelli, William Yeoh, Rina Dechter
2016	Misc	`conf`	Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. ISAIM Junkyu Lee, Radu Marinescu, Rina Dechter
2016	A*	`conf`	From Exact to Anytime Solutions for Marginal MAP. AAAI Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler
2016	A*	`conf`	Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. IJCAI Javier Larrosa, Emma Rollon, Rina Dechter
2016	A*	`conf`	Look-Ahead with Mini-Bucket Heuristics for MPE. AAAI Rina Dechter, Kalev Kask, William Lam, Javier Larrosa
2016	A	`conf`	On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. ECAI William Lam, Kalev Kask, Rina Dechter, Javier Larrosa
2016	A*	`conf`	Probabilistic Inference Modulo Theories. IJCAI Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter
2016	J	`jnl`	Probabilistic Inference Modulo Theories. CoRR Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter
2016	J	`jnl`	Searching for the M Best Solutions in Graphical Models. J. Artif. Intell. Res. Natalia Flerova, Radu Marinescu, Rina Dechter
2015	B	`conf`	Caching in Context-Minimal OR Spaces. SOCS Rina Dechter, Levi H. S. Lelis, Lars Otten
2015	B	`conf`	Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. SOCS William Lam, Kalev Kask, Rina Dechter
2015	A*	`conf`	Pushing Forward Marginal MAP with Best-First Search. IJCAI Radu Marinescu, Rina Dechter, Alexander Ihler
2014	J	`jnl`	AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR Robert Mateescu, Rina Dechter, Radu Marinescu
2014	A	`conf`	AND/OR Search for Marginal MAP. UAI Radu Marinescu, Rina Dechter, Alexander Ihler
2014	J	`jnl`	Active Tuples-based Scheme for Bounding Posterior Beliefs. CoRR Bozhena Bidyuk, Rina Dechter, Emma Rollon
2014	A	`conf`	Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). CP Lars Otten, Rina Dechter
2014	—	`conf`	Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. StarAI@AAAI Junkyu Lee, Radu Marinescu, Rina Dechter
2014	B	`conf`	Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. SOCS William Lam, Kalev Kask, Rina Dechter, Alexander Ihler
2014	B	`conf`	Evaluating Weighted DFS Branch and Bound over Graphical Models. SOCS Natalia Flerova, Radu Marinescu, Rina Dechter
2014	J	`jnl`	Join-Graph Propagation Algorithms. CoRR Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter
2014	A	`conf`	Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP Levi H. S. Lelis, Lars Otten, Rina Dechter
2014	B	`conf`	STLS: Cycle-Cutset-Driven Local Search For MPE. SOCS Alon Milchgrub, Rina Dechter
2014	Misc	`conf`	Weighted Best First Search for Graphical Models. ISAIM Natalia Flerova, Radu Marinescu, Rina Dechter
2013	J	`jnl`	A Scheme for Approximating Probabilistic Inference CoRR Rina Dechter, Irina Rish
2013	J	`jnl`	A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger
2013	J	`jnl`	A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. Mark Silberstein, Omer Weissbrod, Lars Otten, Anna Tzemach, Andrei Anisenia, Oren Shtark, Dvir Tuberg, Eddie Galfrin, Irena Gannon, Adel Shalata, Zvi U. Borochowitz, Rina Dechter, Elizabeth Thompson, Dan Geiger
2013	J	`jnl`	An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits CoRR Yousri El Fattah, Rina Dechter
2013	J	`jnl`	Bucket Elimination: A Unifying Framework for Several Probabilistic Inference CoRR Rina Dechter
2013	J	`jnl`	Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding CoRR Irina Rish, Kalev Kask, Rina Dechter
2013	J	`jnl`	Hybrid Processing of Beliefs and Constraints CoRR Rina Dechter, David Ephraim Larkin
2013	J	`jnl`	Identifying Independencies in Causal Graphs with Feedback CoRR Judea Pearl, Rina Dechter
2013	J	`jnl`	Iterative Join-Graph Propagation CoRR Rina Dechter, Kalev Kask, Robert Mateescu
2013	J	`jnl`	Mini-Bucket Heuristics for Improved Search CoRR Kalev Kask, Rina Dechter
2013	A*	`conf`	Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI Levi H. S. Lelis, Lars Otten, Rina Dechter
2013	—	`book`	Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms Reasoning with Probabilistic and Deterministic Graphical Models Rina Dechter
2013	A*	`conf`	Semiring-Based Mini-Bucket Partitioning Schemes. IJCAI Emma Rollon, Javier Larrosa, Rina Dechter
2013	J	`jnl`	Topological Parameters for Time-Space Tradeoff CoRR Rina Dechter
2012	J	`jnl`	A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models CoRR Lars Otten, Rina Dechter
2012	A	`conf`	A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI Lars Otten, Rina Dechter
2012	J	`jnl`	A Complete Anytime Algorithm for Treewidth CoRR Vibhav Gogate, Rina Dechter
2012	J	`jnl`	A Simple Insight into Iterative Belief Propagation's Success CoRR Rina Dechter, Robert Mateescu
2012	J	`jnl`	AND/OR Importance Sampling CoRR Vibhav Gogate, Rina Dechter
2012	J	`jnl`	AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models CoRR Robert Mateescu, Rina Dechter
2012	A	`conf`	Advances in Distributed Branch and Bound. ECAI Lars Otten, Rina Dechter
2012	J	`jnl`	An Empirical Study of w-Cutset Sampling for Bayesian Networks CoRR Bozhena Bidyuk, Rina Dechter
2012	J	`jnl`	Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. Lars Otten, Rina Dechter
2012	J	`jnl`	Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints CoRR Vibhav Gogate, Rina Dechter
2012	J	`jnl`	BEEM : Bucket Elimination with External Memory CoRR Kalev Kask, Rina Dechter, Andrew Gelfand
2012	J	`jnl`	Best-First AND/OR Search for Most Probable Explanations CoRR Radu Marinescu, Rina Dechter
2012	J	`jnl`	Bounding Search Space Size via (Hyper)tree Decompositions CoRR Lars Otten, Rina Dechter
2012	J	`jnl`	Cutset Sampling with Likelihood Weighting. CoRR Bozhena Bidyuk, Rina Dechter
2012	J	`jnl`	Importance sampling-based estimation over AND/OR search spaces for graphical models. Artif. Intell. Vibhav Gogate, Rina Dechter
2012	J	`jnl`	Join-graph based cost-shifting schemes CoRR Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten
2012	A	`conf`	Join-graph based cost-shifting schemes. UAI Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten
2012	J	`jnl`	Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space CoRR Rina Dechter, Robert Mateescu
2012	J	`jnl`	Modeling Transportation Routines using Hybrid Dynamic Mixed Networks CoRR Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca
2012	J	`jnl`	On finding minimal w-cutset CoRR Bozhena Bidyuk, Rina Dechter
2012	J	`jnl`	Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006) CoRR Rina Dechter, Thomas S. Richardson
2012	A*	`conf`	Search Algorithms for m Best Solutions for Graphical Models. AAAI Rina Dechter, Natalia Flerova, Radu Marinescu
2012	J	`jnl`	Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality CoRR Vibhav Gogate, Bozhena Bidyuk, Rina Dechter
2012	J	`jnl`	Systematic vs. Non-systematic Algorithms for Solving the MPE Task CoRR Radu Marinescu, Kalev Kask, Rina Dechter
2012	J	`jnl`	The Relationship Between AND/OR Search and Variable Elimination CoRR Robert Mateescu, Rina Dechter
2011	B	`conf`	Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS Lars Otten, Rina Dechter
2011	—	`conf`	Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models. GKR Natalia Flerova, Emma Rollon, Rina Dechter
2011	J	`jnl`	Cutset Sampling for Bayesian Networks CoRR Bozhena Bidyuk, Rina Dechter
2011	Misc	`conf`	Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing Lars Otten, Rina Dechter
2011	A*	`conf`	Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter
2011	J	`jnl`	SampleSearch: Importance sampling in presence of determinism. Artif. Intell. Vibhav Gogate, Rina Dechter
2011	J	`jnl`	Sampling-based lower bounds for counting queries. Intelligenza Artificiale Vibhav Gogate, Rina Dechter
2011	A*	`conf`	Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI Andrew Gelfand, Kalev Kask, Rina Dechter
2010	J	`jnl`	Active Tuples-based Scheme for Bounding Posterior Beliefs. J. Artif. Intell. Res. Bozhena Bidyuk, Rina Dechter, Emma Rollon
2010	A	`conf`	BEEM : Bucket Elimination with External Memory. UAI Kalev Kask, Rina Dechter, Andrew Gelfand
2010	Misc	`conf`	Evaluating partition strategies for mini-bucket elimination. ISAIM Emma Rollon, Rina Dechter
2010	J	`jnl`	Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints An Int. J. Radu Marinescu, Rina Dechter
2010	J	`jnl`	Join-Graph Propagation Algorithms. J. Artif. Intell. Res. Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter
2010	A*	`conf`	New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. AAAI Emma Rollon, Rina Dechter
2010	A	`conf`	On Combining Graph-based Variance Reduction schemes. AISTATS Vibhav Gogate, Rina Dechter
2010	Misc	`conf`	Toward parallel search for optimization in graphical models. ISAIM Lars Otten, Rina Dechter
2009	J	`jnl`	AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. Radu Marinescu, Rina Dechter
2009	J	`jnl`	Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. Radu Marinescu, Rina Dechter
2008	A	`conf`	AND/OR Importance Sampling. UAI Vibhav Gogate, Rina Dechter
2008	J	`jnl`	AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. Robert Mateescu, Rina Dechter, Radu Marinescu
2008	—	`conf`	AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models Robert Mateescu, Rina Dechter
2008	A	`conf`	Approximate Solution Sampling (and Counting) on AND/OR Spaces. CP Vibhav Gogate, Rina Dechter
2008	A	`conf`	Bounding Search Space Size via (Hyper)tree Decompositions. UAI Lars Otten, Rina Dechter
2008	—	`conf`	Evaluating probabilistic reasoning systems. BMA Adnan Darwiche, Rina Dechter
2008	J	`jnl`	Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. Robert Mateescu, Rina Dechter
2008	A	`conf`	On the Practical Significance of Hypertree vs. TreeWidth. ECAI Rina Dechter, Lars Otten, Radu Marinescu
2008	A	`conf`	Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP Lars Otten, Rina Dechter
2008	—	`conf`	Robust Solutions in Unstable Optimization Problems. CSCLP Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter
2008	A*	`conf`	Studies in Solution Sampling. AAAI Vibhav Gogate, Rina Dechter
2007	A*	`conf`	A Comparison of Time-Space Schemes for Graphical Models. IJCAI Robert Mateescu, Rina Dechter
2007	A	`conf`	AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. UAI Robert Mateescu, Rina Dechter
2007	A	`conf`	AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP Robert Mateescu, Radu Marinescu, Rina Dechter
2007	J	`jnl`	AND/OR search spaces for graphical models. Artif. Intell. Rina Dechter, Robert Mateescu
2007	A*	`conf`	Approximate Counting by Sampling the Backtrack-free Search Space. AAAI Vibhav Gogate, Rina Dechter
2007	B	`conf`	Best-First AND/OR Search for 0/1 Integer Programming. CPAIOR Radu Marinescu, Rina Dechter
2007	A*	`conf`	Best-First AND/OR Search for Graphical Models. AAAI Radu Marinescu, Rina Dechter
2007	A	`conf`	Best-First AND/OR Search for Most Probable Explanations. UAI Radu Marinescu, Rina Dechter
2007	J	`jnl`	Cutset Sampling for Bayesian Networks. J. Artif. Intell. Res. Bozhena Bidyuk, Rina Dechter
2007	A	`conf`	SampleSearch: A Scheme that Searches for Consistent Samples. AISTATS Vibhav Gogate, Rina Dechter
2007	A	`conf`	Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. UAI Vibhav Gogate, Bozhena Bidyuk, Rina Dechter
2006	A	`conf`	A New Algorithm for Sampling CSP Solutions Uniformly at Random. CP Vibhav Gogate, Rina Dechter
2006	B	`conf`	AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. CPAIOR Radu Marinescu, Rina Dechter
2006	A*	`conf`	An Anytime Scheme for Bounding Posterior Beliefs. AAAI Bozhena Bidyuk, Rina Dechter
2006	A	`conf`	Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). CP Robert Mateescu, Rina Dechter
2006	A	`conf`	Cutset Sampling with Likelihood Weighting. UAI Bozhena Bidyuk, Rina Dechter
2006	A	`conf`	Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. ECAI Radu Marinescu, Rina Dechter
2006	A	`conf`	Improving Bound Propagation. ECAI Bozhena Bidyuk, Rina Dechter
2006	A*	`conf`	Memory Intensive Branch-and-Bound Search for Graphical Models. AAAI Radu Marinescu, Rina Dechter
2006	—	`ch.`	Tractable Structures for Constraint Satisfaction Problems. Handbook of Constraint Programming Rina Dechter
2005	A*	`conf`	AND/OR Branch-and-Bound for Graphical Models. IJCAI Radu Marinescu, Rina Dechter
2005	A	`conf`	AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. CP Radu Marinescu, Rina Dechter
2005	A*	`conf`	AND/OR Cutset Conditioning. IJCAI Robert Mateescu, Rina Dechter
2005	A	`conf`	AND/OR Search Spaces and the Semantic Width of Constraint Networks. CP Robert Mateescu, Rina Dechter
2005	A	`conf`	Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. UAI Vibhav Gogate, Rina Dechter
2005	A	`conf`	Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. UAI Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca
2005	A	`conf`	The Relationship Between AND/OR Search and Variable Elimination. UAI Robert Mateescu, Rina Dechter
2005	J	`jnl`	Unifying tree decompositions for reasoning in graphical models. Artif. Intell. Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter
2004	A	`conf`	A Complete Anytime Algorithm for Treewidth. UAI Vibhav Gogate, Rina Dechter
2004	B	`conf`	Constraints and Probabilistic Networks: A Look At The Interface. LPNMR Rina Dechter
2004	A	`conf`	Counting-Based Look-Ahead Schemes for Constraint Satisfaction. CP Kalev Kask, Rina Dechter, Vibhav Gogate
2004	A	`conf`	Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. UAI Rina Dechter, Robert Mateescu
2004	—	`conf`	New Look-Ahead Schemes for Constraint Satisfaction. AI&M Kalev Kask, Rina Dechter, Vibhav Gogate
2004	A	`conf`	On Finding Minimal w-cutset. UAI Bozhena Bidyuk, Rina Dechter
2004	A	`conf`	The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. CP Rina Dechter, Robert Mateescu
2003	A	`conf`	A Simple Insight into Iterative Belief Propagation's Success. UAI Rina Dechter, Robert Mateescu
2003	A	`conf`	An Empirical Study of w-Cutset Sampling for Bayesian Networks. UAI Bozhena Bidyuk, Rina Dechter
2003	A	`conf`	Bayesian Inference in the Presence of Determinism. AISTATS David Larkin, Rina Dechter
2003	J	`jnl`	Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints An Int. J. Javier Larrosa, Rina Dechter
2003	—	`book`	Constraint processing. Rina Dechter
2003	Misc	`conf`	Cycle-Cutset Sampling for Bayesian Networks. AI Bozhena Bidyuk, Rina Dechter
2003	J	`jnl`	Guest Editorial. Constraints An Int. J. Rina Dechter
2003	J	`jnl`	Mini-buckets: A general scheme for bounded inference. J. ACM Rina Dechter, Irina Rish
2003	A	`conf`	Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI Radu Marinescu, Kalev Kask, Rina Dechter
2002	J	`jnl`	Backjump-based backtracking for constraint satisfaction problems. Artif. Intell. Rina Dechter, Daniel Frost
2002	—	`conf`	Generating Random Solutions for Constraint Satisfaction Problems. AAAI/IAAI Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek
2002	A	`conf`	Iterative Join-Graph Propagation. UAI Rina Dechter, Kalev Kask, Robert Mateescu
2002	—	`ed.`	Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 - August 1, 2002, Edmonton, Alberta, Canada. AAAI Rina Dechter, Michael J. Kearns, Richard S. Sutton
2002	—	`conf`	Tree Approximation for Belief Updating. AAAI/IAAI Robert Mateescu, Rina Dechter, Kalev Kask
2001	A	`conf`	A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. CP Rina Dechter, Kalev Kask, Javier Larrosa
2001	J	`jnl`	A general scheme for automatic generation of search heuristics from specification dependencies. Artif. Intell. Kalev Kask, Rina Dechter
2001	J	`jnl`	Heuristic search in artificial intelligence. Artif. Intell. Weixiong Zhang, Rina Dechter, Richard E. Korf
2001	A	`conf`	Hybrid Processing of Beliefs and Constraints. UAI Rina Dechter, David Larkin
2001	J	`jnl`	Topological parameters for time-space tradeoff. Artif. Intell. Rina Dechter, Yousri El Fattah
2000	—	`conf`	A New Perspective on Algorithms for Optimizing Policies under Uncertainty. AIPS Rina Dechter
2000	—	`conf`	An Implementation of the Combinatorial Auction Problem in ECL AAAI/IAAI Robert Menke, Rina Dechter
2000	A	`ed.`	Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings CP Rina Dechter
2000	J	`jnl`	Resolution versus Search: Two Strategies for SAT. J. Autom. Reason. Irina Rish, Rina Dechter
1999	A*	`conf`	Branch and Bound with Mini-Bucket Heuristics. IJCAI Kalev Kask, Rina Dechter
1999	J	`jnl`	Bucket Elimination: A Unifying Framework for Reasoning. Artif. Intell. Rina Dechter
1999	J	`jnl`	Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. Daniel Frost, Rina Dechter
1999	A	`conf`	Mini-Bucket Heuristics for Improved Search. UAI Kalev Kask, Rina Dechter
1999	J	`jnl`	Self-Stabilizing Distributed Constraint Satisfaction. Chic. J. Theor. Comput. Sci. Zeev Collin, Rina Dechter, Shmuel Katz
1999	A	`conf`	Stochastic local search for Bayesian network. AISTATS Kalev Kask, Rina Dechter
1998	—	`ch.`	Bucket Elimination: A Unifying Framework for Probabilistic Inference. Learning in Graphical Models Rina Dechter
1998	A	`conf`	Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. UAI Irina Rish, Kalev Kask, Rina Dechter
1998	A	`conf`	Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. CP Daniel Frost, Rina Dechter
1997	A	`conf`	A Scheme for Approximating Probabilistic Inference. UAI Rina Dechter, Irina Rish
1997	J	`jnl`	Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. Constraints An Int. J. Rina Dechter
1997	J	`jnl`	Constraint tightness and looseness versus local and global consistency. J. ACM Peter van Beek, Rina Dechter
1997	J	`jnl`	Local and Global Relational Consistency. Theor. Comput. Sci. Rina Dechter, Peter van Beek
1997	—	`conf`	Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. IJCAI Rina Dechter
1997	J	`jnl`	Processing Disjunctions in Temporal Constraint Networks. Artif. Intell. Eddie Schwalb, Rina Dechter
1997	Misc	`conf`	Simple distributed algorithms for the cycle cutset problem. SAC Arun K. Jagota, Rina Dechter
1996	—	`conf`	A Graph-Based Method for Improving GSAT. AAAI/IAAI, Vol. 1 Kalev Kask, Rina Dechter
1996	A	`conf`	An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. UAI Yousri El Fattah, Rina Dechter
1996	J	`jnl`	Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints. ACM Comput. Surv. Rina Dechter
1996	A	`conf`	Bucket elimination: A unifying framework for probabilistic inference. UAI Rina Dechter
1996	J	`jnl`	Default Reasoning Using Classical Logic. Artif. Intell. Rachel Ben-Eliyahu, Rina Dechter
1996	A	`conf`	Identifying Independencies in Causal Graphs with Feedback. UAI Judea Pearl, Rina Dechter
1996	A	`conf`	Looking at Full Looking Ahead. CP Daniel Frost, Rina Dechter
1996	J	`jnl`	On Computing Minimal Models. Ann. Math. Artif. Intell. Rachel Ben-Eliyahu, Rina Dechter
1996	C	`conf`	Processing Disjunctions of Temporal Constraints. TIME Eddie Schwalb, Rina Dechter
1996	J	`jnl`	Structure-Driven Algorithms for Truth Maintenance. Artif. Intell. Rina Dechter, Avi Dechter
1996	A	`conf`	To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). CP Irina Rish, Rina Dechter
1996	A	`conf`	Topological parameters for time-space tradeoff. UAI Rina Dechter
1996	J	`jnl`	Uncovering Trees in Constraint Networks. Artif. Intell. Itay Meiri, Rina Dechter, Judea Pearl
1995	A*	`conf`	Diagnosing Tree-Decomposable Circuits. IJCAI Yousri El Fattah, Rina Dechter
1995	A*	`conf`	GSAT and Local Consistency. IJCAI (1) Kalev Kask, Rina Dechter
1995	J	`jnl`	Improving Connectionist Energy Minimization. CoRR Gadi Pinkas, Rina Dechter
1995	J	`jnl`	Improving Connectionist Energy Minimization. J. Artif. Intell. Res. Gadi Pinkas, Rina Dechter
1995	A	`conf`	Local and Global Relational Consistency. CP Rina Dechter, Peter van Beek
1995	A*	`conf`	Look-Ahead Value Ordering for Constraint Satisfaction Problems. IJCAI (1) Daniel Frost, Rina Dechter
1995	J	`jnl`	On the Minimality and Decomposability of Row-Convex Constraint Networks. J. ACM Peter van Beek, Rina Dechter
1995	A*	`conf`	Systematic Versus Stochastic Constraint Satisfaction. IJCAI Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang
1994	A*	`conf`	Constraint Tightness versus Global Consistency. KR Peter van Beek, Rina Dechter
1994	A*	`conf`	Dead-End Driven Learning. AAAI Daniel Frost, Rina Dechter
1994	A*	`conf`	Directional Resolution: The Davis-Putnam Procedure, Revisited. KR Rina Dechter, Irina Rish
1994	J	`jnl`	Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. Artif. Intell. Rina Dechter, Itay Meiri
1994	A*	`conf`	In Search of the Best Constraint Satisfaction Search. AAAI Daniel Frost, Rina Dechter
1994	J	`jnl`	Propositional Semantics for Disjunctive Logic Programs. Ann. Math. Artif. Intell. Rachel Ben-Eliyahu, Rina Dechter
1994	A*	`conf`	Temporal Reasoning with Constraints on Fluents and Events. AAAI Eddie Schwalb, Kalev Kask, Rina Dechter
1993	A*	`conf`	Coping With Disjunctions in Temporal Constraint Satisfaction Problems. AAAI Eddie Schwalb, Rina Dechter
1993	A*	`conf`	On Computing Minimal Models. AAAI Rachel Ben-Eliyahu, Rina Dechter
1992	A*	`conf`	An Improved Connectionist Activation Function for Energy Minimization. AAAI Gadi Pinkas, Rina Dechter
1992	J	`jnl`	From Local to Global Consistency. Artif. Intell. Rina Dechter
1992	—	`conf`	Propositional Sematics for Disjunctive Logic Programs. JICSLP Rachel Ben-Eliyahu, Rina Dechter
1992	J	`jnl`	Structure Identification in Relational Data. Artif. Intell. Rina Dechter, Judea Pearl
1991	A*	`conf`	Default Logic, Propositional Logic, and Constraints. AAAI Rachel Ben-Eliyahu, Rina Dechter
1991	A*	`conf`	Directed Constraint Networks: A Relational Framework for Causal Modeling. IJCAI Rina Dechter, Judea Pearl
1991	A*	`conf`	On the Feasibility of Distributed Constraint Satisfaction. IJCAI Zeev Collin, Rina Dechter, Shmuel Katz
1991	J	`jnl`	Temporal Constraint Networks. Artif. Intell. Rina Dechter, Itay Meiri, Judea Pearl
1990	J	`jnl`	Decomposing a Relation into a Tree of Binary Relations. J. Comput. Syst. Sci. Rina Dechter
1990	J	`jnl`	Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artif. Intell. Rina Dechter
1990	A*	`conf`	On the Expressiveness of Networks with Hidden Variables. AAAI Rina Dechter
1990	A*	`conf`	Tree Decomposition with Applications to Constraint Processing. AAAI Itay Meiri, Judea Pearl, Rina Dechter
1989	A*	`conf`	Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. IJCAI Rina Dechter, Itay Meiri
1989	A*	`conf`	Learning Structure from Data: A Survey. COLT Judea Pearl, Rina Dechter
1989	J	`jnl`	On the Greedy Solution of Ordering Problems. INFORMS J. Comput. Avi Dechter, Rina Dechter
1989	A*	`conf`	Temporal Constraint Networks. KR Rina Dechter, Itay Meiri, Judea Pearl
1989	J	`jnl`	Tree Clustering for Constraint Networks. Artif. Intell. Rina Dechter, Judea Pearl
1988	A*	`conf`	Belief Maintenance in Dynamic Constraint Networks. AAAI Rina Dechter, Avi Dechter
1988	A*	`conf`	Tree-Clustering Schemes for Constraint-Processing. AAAI Rina Dechter, Judea Pearl
1987	A*	`conf`	Decomposing an N-ary Relation into a Tree of Binary Relations. PODS Rina Dechter
1987	J	`jnl`	Network-Based Heuristics for Constraint-Satisfaction Problems. Artif. Intell. Rina Dechter, Judea Pearl
1987	A*	`conf`	Removing Redundancies in Constraint Networks. AAAI Avi Dechter, Rina Dechter
1986	J	`jnl`	Broadcast Communications and Distributed Algorithms. IEEE Trans. Computers Rina Dechter, Leonard Kleinrock
1986	A*	`conf`	Learning While Searching in Constraint-Satisfaction-Problems. AAAI Rina Dechter
1985	J	`jnl`	Generalized Best-First Search Strategies and the Optimality of A* J. ACM Rina Dechter, Judea Pearl
1985	A*	`conf`	The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. IJCAI Rina Dechter, Judea Pearl
1983	A*	`conf`	The Optimality of A* Revisited. AAAI Rina Dechter, Judea Pearl
1980	J	`jnl`	Probabilistic Analysis of the Complexity of A Artif. Intell. Nam Huyn, Rina Dechter, Judea Pearl