default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRina Dechter
Person information
- affiliation: University of California, Irvine, USA
- award (1991): Presidential Young Investigator Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c155]Vincent Hsiao, Dana S. Nau, Bobak Pezeshki, Rina Dechter:
Surrogate Bayesian Networks for Approximating Evolutionary Games. AISTATS 2024: 2566-2574- [c154]Anna Raichev, Jin Tian, Alexander Ihler, Rina Dechter:
Estimating Causal Effects from Learned Causal Networks. ECAI 2024: 2524-2531 - [i37]Anna Raichev, Alexander Ihler, Jin Tian, Rina Dechter:
Estimating Causal Effects from Learned Causal Networks. CoRR abs/2408.14101 (2024) - 2023
- [c153]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-based computational protein design: dynamic heuristics and generalizable UFO. UAI 2023: 1662-1672 - [i36]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
Boosting AND/OR-Based Computational Protein Design: Dynamic Heuristics and Generalizable UFO. CoRR abs/2309.00408 (2023) - 2022
- [c152]Vincent Hsiao, Dana S. Nau, Rina Dechter:
Fast Fourier Transform Reductions for Bayesian Network Inference. AISTATS 2022: 6445-6458 - [c151]Sakshi Agarwal, Kalev Kask, Alexander Ihler, Rina Dechter:
NeuroBE: Escalating neural network approximations of Bucket Elimination. UAI 2022: 11-21 - [c150]Bobak Pezeshki, Radu Marinescu, Alexander Ihler, Rina Dechter:
AND/OR branch-and-bound for computational protein design optimizing K. UAI 2022: 1602-1612 - [e3]Hector Geffner, Rina Dechter, Joseph Y. Halpern:
Probabilistic and Causal Inference: The Works of Judea Pearl. ACM Books 36, ACM 2022, ISBN 978-1-4503-9586-1 [contents] - 2021
- [c149]Junkyu Lee, Radu Marinescu, Rina Dechter:
Submodel Decomposition Bounds for Influence Diagrams. AAAI 2021: 12147-12157 - [c148]Radu Marinescu, Junkyu Lee, Rina Dechter:
A New Bounding Scheme for Influence Diagrams. AAAI 2021: 12158-12165 - [c147]Vincent Hsiao, Xinyue Pan, Dana S. Nau, Rina Dechter:
Approximating Spatial Evolutionary Games using Bayesian Networks. AAMAS 2021: 1533-1535 - [c146]Yasaman Razeghi, Kalev Kask, Yadong Lu, Pierre Baldi, Sakshi Agarwal, Rina Dechter:
Deep Bucket Elimination. IJCAI 2021: 4235-4242 - 2020
- [c145]Kalev Kask, Bobak Pezeshki, Filjor Broka, Alexander Ihler, Rina Dechter:
Scaling Up AND/OR Abstraction Sampling. IJCAI 2020: 4266-4274 - [c144]Junkyu Lee, Radu Marinescu, Rina Dechter:
Heuristic AND/OR Search for Solving Influence Diagram. SOCS 2020: 127-128
2010 – 2019
- 2019
- [b3]Rina Dechter:
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, Second Edition. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00455-1 - [c143]Qi Lou, Rina Dechter, Alexander Ihler:
Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms. AAAI 2019: 7900-7907 - [c142]Radu Marinescu, Akihiro Kishimoto, Adi Botea, Rina Dechter, Alexander Ihler:
Anytime Recursive Best-First Search for Bounding Marginal MAP. AAAI 2019: 7924-7932 - [c141]Radu Marinescu, Rina Dechter:
Counting the Optimal Solutions in Graphical Models. NeurIPS 2019: 12091-12101 - [c140]Junkyu Lee, Radu Marinescu, Alexander Ihler, Rina Dechter:
A Weighted Mini-Bucket Bound for Solving Influence Diagram. UAI 2019: 1159-1168 - 2018
- [j58]Ferdinando Fioretto
, Enrico Pontelli, William Yeoh, Rina Dechter:
Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs. Constraints An Int. J. 23(1): 1-43 (2018) - [j57]Radu Marinescu, Junkyu Lee, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. J. Artif. Intell. Res. 63: 875-921 (2018) - [j56]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Subproblem ordering heuristics for AND/OR best-first search. J. Comput. Syst. Sci. 94: 41-62 (2018) - [c139]Junkyu Lee, Alexander Ihler, Rina Dechter:
Generalized Dual Decomposition for Bounding Maximum Expected Utility of Influence Diagrams with Perfect Recall. AAAI Workshops 2018: 674-681 - [c138]Qi Lou, Rina Dechter, Alexander Ihler:
Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP. AAAI 2018: 6392-6400 - [c137]Radu Marinescu, Rina Dechter, Alexander Ihler:
Stochastic Anytime Search for Bounding Marginal MAP. IJCAI 2018: 5074-5081 - [c136]Filjor Broka, Rina Dechter, Alexander Ihler, Kalev Kask:
Abstraction Sampling in Graphical Models. UAI 2018: 632-641 - [c135]Qi Lou, Rina Dechter, Alexander Ihler:
Finite-sample Bounds for Marginal MAP. UAI 2018: 725-734 - [c134]Junkyu Lee, Alexander Ihler, Rina Dechter:
Join Graph Decomposition Bounds for Influence Diagrams. UAI 2018: 1053-1062 - 2017
- [j55]Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted heuristic anytime search: new schemes for optimization over graphical models. Ann. Math. Artif. Intell. 79(1-3): 77-128 (2017) - [j54]Lars Otten, Rina Dechter:
AND/OR Branch-and-Bound on a Computational Grid. J. Artif. Intell. Res. 59: 351-435 (2017) - [j53]William Lam, Kalev Kask, Javier Larrosa, Rina Dechter:
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models. J. Artif. Intell. Res. 60: 287-346 (2017) - [c133]Qi Lou, Rina Dechter, Alexander Ihler:
Anytime Anyspace AND/OR Search for Bounding the Partition Function. AAAI 2017: 860-867 - [c132]Radu Marinescu, Junkyu Lee, Alexander Ihler, Rina Dechter:
Anytime Best+Depth-First Search for Bounding Marginal MAP. AAAI 2017: 3775-3782 - [c131]Qi Lou, Rina Dechter, Alexander Ihler:
Dynamic Importance Sampling for Anytime Bounds of the Partition Function. NIPS 2017: 3196-3204 - 2016
- [j52]Natalia Flerova, Radu Marinescu, Rina Dechter:
Searching for the M Best Solutions in Graphical Models. J. Artif. Intell. Res. 55: 889-952 (2016) - [c130]Rina Dechter, Kalev Kask, William Lam, Javier Larrosa:
Look-Ahead with Mini-Bucket Heuristics for MPE. AAAI 2016: 694-701 - [c129]Junkyu Lee, Radu Marinescu, Rina Dechter, Alexander Ihler:
From Exact to Anytime Solutions for Marginal MAP. AAAI 2016: 3255-3262 - [c128]William Lam, Kalev Kask, Rina Dechter, Javier Larrosa:
On the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds. ECAI 2016: 1567-1568 - [c127]Javier Larrosa, Emma Rollon, Rina Dechter:
Limited Discrepancy AND/OR Search and Its Application to Optimization Tasks in Graphical Models. IJCAI 2016: 617-623 - [c126]Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter:
Probabilistic Inference Modulo Theories. IJCAI 2016: 3591-3599 - [c125]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Search Based Probabilistic Inference Algorithms to Probabilistic Conformant Planning: Preliminary Results. ISAIM 2016 - [i35]Rodrigo de Salvo Braz, Ciaran O'Reilly, Vibhav Gogate, Rina Dechter:
Probabilistic Inference Modulo Theories. CoRR abs/1605.08367 (2016) - [i34]Ferdinando Fioretto, Enrico Pontelli, William Yeoh, Rina Dechter:
Accelerating Exact and Approximate Inference for (Distributed) Discrete Optimization with GPUs. CoRR abs/1608.05288 (2016) - 2015
- [c124]Radu Marinescu, Rina Dechter, Alexander Ihler:
Pushing Forward Marginal MAP with Best-First Search. IJCAI 2015: 696-702 - [c123]Rina Dechter, Levi H. S. Lelis, Lars Otten:
Caching in Context-Minimal OR Spaces. SOCS 2015: 171-175 - [c122]William Lam, Kalev Kask, Rina Dechter:
Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation. SOCS 2015: 212-213 - 2014
- [c121]Junkyu Lee, Radu Marinescu, Rina Dechter:
Applying Marginal MAP Search to Probabilistic Conformant Planning: Initial Results. StarAI@AAAI 2014 - [c120]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models. CP 2014: 481-496 - [c119]Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization - (Extended Abstract). CP 2014: 933-937 - [c118]Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted Best First Search for Graphical Models. ISAIM 2014 - [c117]Natalia Flerova, Radu Marinescu, Rina Dechter:
Evaluating Weighted DFS Branch and Bound over Graphical Models. SOCS 2014: 71-79 - [c116]William Lam, Kalev Kask, Rina Dechter, Alexander Ihler:
Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics. SOCS 2014: 105-113 - [c115]Alon Milchgrub, Rina Dechter:
STLS: Cycle-Cutset-Driven Local Search For MPE. SOCS 2014: 204-205 - [c114]Radu Marinescu, Rina Dechter, Alexander Ihler:
AND/OR Search for Marginal MAP. UAI 2014: 563-572 - [i33]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. CoRR abs/1401.3448 (2014) - [i32]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. CoRR abs/1401.3489 (2014) - [i31]Bozhena Bidyuk, Rina Dechter, Emma Rollon:
Active Tuples-based Scheme for Bounding Posterior Beliefs. CoRR abs/1401.3833 (2014) - 2013
- [b2]Rina Dechter:
Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2013, ISBN 978-3-031-01566-3 - [j51]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:
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. 29(2): 197-205 (2013) - [j50]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:
A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinform. 29(5): 669 (2013) - [c113]Levi H. S. Lelis, Lars Otten, Rina Dechter:
Predicting the Size of Depth-First Branch and Bound Search Trees. IJCAI 2013: 594-600 - [c112]Emma Rollon, Javier Larrosa, Rina Dechter:
Semiring-Based Mini-Bucket Partitioning Schemes. IJCAI 2013: 644-650 - [i30]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. CoRR abs/1301.0564 (2013) - [i29]Rina Dechter, David Ephraim Larkin:
Hybrid Processing of Beliefs and Constraints. CoRR abs/1301.2265 (2013) - [i28]Kalev Kask, Rina Dechter:
Mini-Bucket Heuristics for Improved Search. CoRR abs/1301.6708 (2013) - [i27]Irina Rish, Kalev Kask, Rina Dechter:
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. CoRR abs/1301.7409 (2013) - [i26]Rina Dechter, Irina Rish:
A Scheme for Approximating Probabilistic Inference. CoRR abs/1302.1534 (2013) - [i25]Rina Dechter:
Bucket Elimination: A Unifying Framework for Several Probabilistic Inference. CoRR abs/1302.3572 (2013) - [i24]Rina Dechter:
Topological Parameters for Time-Space Tradeoff. CoRR abs/1302.3573 (2013) - [i23]Yousri El Fattah, Rina Dechter:
An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits. CoRR abs/1302.3576 (2013) - [i22]Judea Pearl, Rina Dechter:
Identifying Independencies in Causal Graphs with Feedback. CoRR abs/1302.3595 (2013) - 2012
- [j49]Vibhav Gogate, Rina Dechter:
Importance sampling-based estimation over AND/OR search spaces for graphical models. Artif. Intell. 184-185: 38-77 (2012) - [j48]Lars Otten, Rina Dechter:
Anytime AND/OR depth-first search for combinatorial optimization. AI Commun. 25(3): 211-227 (2012) - [c111]Rina Dechter, Natalia Flerova, Radu Marinescu:
Search Algorithms for m Best Solutions for Graphical Models. AAAI 2012: 1895-1901 - [c110]Lars Otten, Rina Dechter:
Advances in Distributed Branch and Bound. ECAI 2012: 917-918 - [c109]Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten:
Join-graph based cost-shifting schemes. UAI 2012: 397-406 - [c108]Lars Otten, Rina Dechter:
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. UAI 2012: 665-674 - [i21]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. CoRR abs/1203.3487 (2012) - [i20]Vibhav Gogate, Rina Dechter:
AND/OR Importance Sampling. CoRR abs/1206.3232 (2012) - [i19]Lars Otten, Rina Dechter:
Bounding Search Space Size via (Hyper)tree Decompositions. CoRR abs/1206.3284 (2012) - [i18]Vibhav Gogate, Bozhena Bidyuk, Rina Dechter:
Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. CoRR abs/1206.5242 (2012) - [i17]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. CoRR abs/1206.5266 (2012) - [i16]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Most Probable Explanations. CoRR abs/1206.5268 (2012) - [i15]Bozhena Bidyuk, Rina Dechter:
Cutset Sampling with Likelihood Weighting. CoRR abs/1206.6822 (2012) - [i14]Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca:
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. CoRR abs/1207.1384 (2012) - [i13]Vibhav Gogate, Rina Dechter:
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. CoRR abs/1207.1385 (2012) - [i12]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. CoRR abs/1207.1407 (2012) - [i11]Vibhav Gogate, Rina Dechter:
A Complete Anytime Algorithm for Treewidth. CoRR abs/1207.4109 (2012) - [i10]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. CoRR abs/1207.4119 (2012) - [i9]Bozhena Bidyuk, Rina Dechter:
On finding minimal w-cutset. CoRR abs/1207.4127 (2012) - [i8]Rina Dechter, Thomas S. Richardson:
Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence (2006). CoRR abs/1208.5160 (2012) - [i7]Alexander Ihler, Natalia Flerova, Rina Dechter, Lars Otten:
Join-graph based cost-shifting schemes. CoRR abs/1210.4878 (2012) - [i6]Lars Otten, Rina Dechter:
A Case Study in Complexity Estimation: Towards Parallel Branch-and-Bound over Graphical Models. CoRR abs/1210.4885 (2012) - [i5]Bozhena Bidyuk, Rina Dechter:
An Empirical Study of w-Cutset Sampling for Bayesian Networks. CoRR abs/1212.2449 (2012) - [i4]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. CoRR abs/1212.2463 (2012) - [i3]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. CoRR abs/1212.2505 (2012) - 2011
- [j47]Vibhav Gogate, Rina Dechter:
SampleSearch: Importance sampling in presence of determinism. Artif. Intell. 175(2): 694-729 (2011) - [j46]Vibhav Gogate, Rina Dechter:
Sampling-based lower bounds for counting queries. Intelligenza Artificiale 5(2): 171-188 (2011) - [c107]Kalev Kask, Andrew Gelfand, Lars Otten, Rina Dechter:
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models. AAAI 2011: 54-60 - [c106]Andrew Gelfand, Kalev Kask, Rina Dechter:
Stopping Rules for Randomized Greedy Triangulation Schemes. AAAI 2011: 1043-1048 - [c105]Natalia Flerova, Emma Rollon, Rina Dechter:
Bucket and Mini-bucket Schemes for M Best Solutions over Graphical Models. GKR 2011: 91-118 - [c104]Lars Otten, Rina Dechter:
Finding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing. Pacific Symposium on Biocomputing 2011: 26-37 - [c103]Lars Otten, Rina Dechter:
Anytime AND/OR Depth-First Search for Combinatorial Optimization. SOCS 2011: 117-124 - [i2]Bozhena Bidyuk, Rina Dechter:
Cutset Sampling for Bayesian Networks. CoRR abs/1110.2740 (2011) - 2010
- [j45]Radu Marinescu, Rina Dechter:
Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints An Int. J. 15(1): 29-63 (2010) - [j44]Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina Dechter:
Join-Graph Propagation Algorithms. J. Artif. Intell. Res. 37: 279-328 (2010) - [j43]Bozhena Bidyuk, Rina Dechter, Emma Rollon:
Active Tuples-based Scheme for Bounding Posterior Beliefs. J. Artif. Intell. Res. 39: 335-371 (2010) - [c102]Emma Rollon, Rina Dechter:
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence. AAAI 2010: 1199-1204 - [c101]Lars Otten, Rina Dechter:
Toward parallel search for optimization in graphical models. ISAIM 2010 - [c100]Emma Rollon, Rina Dechter:
Evaluating partition strategies for mini-bucket elimination. ISAIM 2010 - [c99]Kalev Kask, Rina Dechter, Andrew Gelfand:
BEEM : Bucket Elimination with External Memory. UAI 2010: 268-276 - [c98]Vibhav Gogate, Rina Dechter:
On Combining Graph-based Variance Reduction schemes. AISTATS 2010: 257-264
2000 – 2009
- 2009
- [j42]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1457-1491 (2009) - [j41]Radu Marinescu, Rina Dechter:
Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1492-1524 (2009) - 2008
- [j40]Robert Mateescu, Rina Dechter:
Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008) - [j39]Robert Mateescu, Rina Dechter, Radu Marinescu:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. 33: 465-519 (2008) - [c97]Vibhav Gogate, Rina Dechter:
Studies in Solution Sampling. AAAI 2008: 271-276 - [c96]Robert Mateescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models 2008: 238-257 - [c95]Vibhav Gogate, Rina Dechter:
Approximate Solution Sampling (and Counting) on AND/OR Spaces. CP 2008: 534-538 - [c94]Lars Otten, Rina Dechter:
Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP 2008: 576-581 - [c93]Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter:
Robust Solutions in Unstable Optimization Problems. CSCLP 2008: 116-131 - [c92]Rina Dechter, Lars Otten, Radu Marinescu:
On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914 - [c91]Adnan Darwiche, Rina Dechter:
Evaluating probabilistic reasoning systems. BMA 2008 - [c90]Vibhav Gogate, Rina Dechter:
AND/OR Importance Sampling. UAI 2008: 212-219 - [c89]Lars Otten, Rina Dechter:
Bounding Search Space Size via (Hyper)tree Decompositions. UAI 2008: 452-459 - 2007
- [j38]Rina Dechter, Robert Mateescu:
AND/OR search spaces for graphical models. Artif. Intell. 171(2-3): 73-106 (2007) - [j37]Bozhena Bidyuk, Rina Dechter:
Cutset Sampling for Bayesian Networks. J. Artif. Intell. Res. 28: 1-48 (2007) - [c88]Vibhav Gogate, Rina Dechter:
Approximate Counting by Sampling the Backtrack-free Search Space. AAAI 2007: 198-203 - [c87]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Graphical Models. AAAI 2007: 1171-1176 - [c86]Robert Mateescu, Radu Marinescu, Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513 - [c85]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for 0/1 Integer Programming. CPAIOR 2007: 171-185 - [c84]Robert Mateescu, Rina Dechter:
A Comparison of Time-Space Schemes for Graphical Models. IJCAI 2007: 2346-2352 - [c83]Vibhav Gogate, Bozhena Bidyuk, Rina Dechter:
Studies in Lower Bounding Probabilities of Evidence using the Markov Inequality. UAI 2007: 141-148 - [c82]Radu Marinescu, Rina Dechter:
Best-First AND/OR Search for Most Probable Explanations. UAI 2007: 259-266 - [c81]Robert Mateescu, Rina Dechter:
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical Models. UAI 2007: 276-284 - [c80]Vibhav Gogate, Rina Dechter:
SampleSearch: A Scheme that Searches for Consistent Samples. AISTATS 2007: 147-154 - 2006
- [c79]Bozhena Bidyuk, Rina Dechter:
An Anytime Scheme for Bounding Posterior Beliefs. AAAI 2006: 1095-1100 - [c78]Radu Marinescu, Rina Dechter:
Memory Intensive Branch-and-Bound Search for Graphical Models. AAAI 2006: 1200-1205 - [c77]Robert Mateescu, Rina Dechter:
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). CP 2006: 329-343 - [c76]Vibhav Gogate, Rina Dechter:
A New Algorithm for Sampling CSP Solutions Uniformly at Random. CP 2006: 711-715 - [c75]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. CPAIOR 2006: 152-166 - [c74]Radu Marinescu, Rina Dechter:
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. ECAI 2006: 138-142 - [c73]Bozhena Bidyuk, Rina Dechter:
Improving Bound Propagation. ECAI 2006: 342-346 - [c72]Bozhena Bidyuk, Rina Dechter:
Cutset Sampling with Likelihood Weighting. UAI 2006 - [r1]Rina Dechter:
Tractable Structures for Constraint Satisfaction Problems. Handbook of Constraint Programming 2006: 209-244 - 2005
- [j36]Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter:
Unifying tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2): 165-193 (2005) - [c71]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. CP 2005: 857 - [c70]Robert Mateescu, Rina Dechter:
AND/OR Search Spaces and the Semantic Width of Constraint Networks. CP 2005: 860 - [c69]Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound for Graphical Models. IJCAI 2005: 224-229 - [c68]Robert Mateescu, Rina Dechter:
AND/OR Cutset Conditioning. IJCAI 2005: 230-235 - [c67]Vibhav Gogate, Rina Dechter:
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. UAI 2005: 209-216 - [c66]Vibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca:
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. UAI 2005: 217-224 - [c65]Robert Mateescu, Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination. UAI 2005: 380-387 - 2004
- [c64]Kalev Kask, Rina Dechter, Vibhav Gogate:
Counting-Based Look-Ahead Schemes for Constraint Satisfaction. CP 2004: 317-331 - [c63]Rina Dechter, Robert Mateescu:
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. CP 2004: 731-736 - [c62]Kalev Kask, Rina Dechter, Vibhav Gogate:
New Look-Ahead Schemes for Constraint Satisfaction. AI&M 2004 - [c61]Rina Dechter:
Constraints and Probabilistic Networks: A Look At The Interface. LPNMR 2004: 1 - [c60]Bozhena Bidyuk, Rina Dechter:
On Finding Minimal w-cutset. UAI 2004: 43-50 - [c59]Rina Dechter, Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. UAI 2004: 120-129 - [c58]Vibhav Gogate, Rina Dechter:
A Complete Anytime Algorithm for Treewidth. UAI 2004: 201-208 - 2003
- [b1]Rina Dechter:
Constraint processing. Elsevier Morgan Kaufmann 2003, ISBN 978-1-55860-890-0, pp. I-XX, 1-481 - [j35]Rina Dechter:
Guest Editorial. Constraints An Int. J. 8(3): 227-228 (2003) - [j34]Javier Larrosa, Rina Dechter:
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints An Int. J. 8(3): 303-326 (2003) - [j33]Rina Dechter, Irina Rish:
Mini-buckets: A general scheme for bounded inference. J. ACM 50(2): 107-153 (2003) - [c57]Bozhena Bidyuk, Rina Dechter:
Cycle-Cutset Sampling for Bayesian Networks. AI 2003: 297-312 - [c56]David Larkin, Rina Dechter:
Bayesian Inference in the Presence of Determinism. AISTATS 2003: 187-194 - [c55]Bozhena Bidyuk, Rina Dechter:
An Empirical Study of w-Cutset Sampling for Bayesian Networks. UAI 2003: 37-46 - [c54]Rina Dechter, Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success. UAI 2003: 175-183 - [c53]Radu Marinescu, Kalev Kask, Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI 2003: 394-402 - 2002
- [j32]Rina Dechter, Daniel Frost:
Backjump-based backtracking for constraint satisfaction problems. Artif. Intell. 136(2): 147-188 (2002) - [c52]Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek:
Generating Random Solutions for Constraint Satisfaction Problems. AAAI/IAAI 2002: 15-21 - [c51]Robert Mateescu, Rina Dechter, Kalev Kask:
Tree Approximation for Belief Updating. AAAI/IAAI 2002: 553-559 - [c50]Rina Dechter, Kalev Kask, Robert Mateescu:
Iterative Join-Graph Propagation. UAI 2002: 128-136 - [e2]Rina Dechter, Michael J. Kearns, Richard S. Sutton:
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 Press / The MIT Press 2002 [contents] - 2001
- [j31]Rina Dechter, Yousri El Fattah:
Topological parameters for time-space tradeoff. Artif. Intell. 125(1-2): 93-118 (2001) - [j30]Weixiong Zhang, Rina Dechter, Richard E. Korf:
Heuristic search in artificial intelligence. Artif. Intell. 129(1-2): 1-4 (2001) - [j29]Kalev Kask, Rina Dechter:
A general scheme for automatic generation of search heuristics from specification dependencies. Artif. Intell. 129(1-2): 91-131 (2001) - [c49]Rina Dechter, Kalev Kask, Javier Larrosa:
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. CP 2001: 346-360 - [c48]Rina Dechter, David Larkin:
Hybrid Processing of Beliefs and Constraints. UAI 2001: 112-119 - 2000
- [j28]Irina Rish, Rina Dechter:
Resolution versus Search: Two Strategies for SAT. J. Autom. Reason. 24(1/2): 225-275 (2000) - [c47]Robert Menke, Rina Dechter:
An Implementation of the Combinatorial Auction Problem in ECLiPSe. AAAI/IAAI 2000: 1084 - [c46]Rina Dechter:
A New Perspective on Algorithms for Optimizing Policies under Uncertainty. AIPS 2000: 72-81 - [e1]Rina Dechter:
Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings. Lecture Notes in Computer Science 1894, Springer 2000, ISBN 3-540-41053-8 [contents]
1990 – 1999
- 1999
- [j27]Rina Dechter:
Bucket Elimination: A Unifying Framework for Reasoning. Artif. Intell. 113(1-2): 41-85 (1999) - [j26]Daniel Frost, Rina Dechter:
Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. 26(1-4): 149-170 (1999) - [j25]Zeev Collin, Rina Dechter, Shmuel Katz:
Self-Stabilizing Distributed Constraint Satisfaction. Chic. J. Theor. Comput. Sci. 1999 (1999) - [c45]Kalev Kask, Rina Dechter:
Stochastic local search for Bayesian network. AISTATS 1999 - [c44]Kalev Kask, Rina Dechter:
Branch and Bound with Mini-Bucket Heuristics. IJCAI 1999: 426-435 - [c43]Kalev Kask, Rina Dechter:
Mini-Bucket Heuristics for Improved Search. UAI 1999: 314-323 - 1998
- [c42]Daniel Frost, Rina Dechter:
Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. CP 1998: 469 - [c41]Irina Rish, Kalev Kask, Rina Dechter:
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. UAI 1998: 455-463 - [p1]Rina Dechter:
Bucket Elimination: A Unifying Framework for Probabilistic Inference. Learning in Graphical Models 1998: 75-104 - 1997
- [j24]Eddie Schwalb, Rina Dechter:
Processing Disjunctions in Temporal Constraint Networks. Artif. Intell. 93: 29-61 (1997) - [j23]Rina Dechter:
Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. Constraints An Int. J. 2(1): 51-55 (1997) - [j22]Peter van Beek, Rina Dechter:
Constraint tightness and looseness versus local and global consistency. J. ACM 44(4): 549-566 (1997) - [j21]Rina Dechter, Peter van Beek:
Local and Global Relational Consistency. Theor. Comput. Sci. 173(1): 283-308 (1997) - [c40]Rina Dechter:
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. IJCAI 1997: 1297-1303 - [c39]Arun K. Jagota, Rina Dechter:
Simple distributed algorithms for the cycle cutset problem. SAC 1997: 366-373 - [c38]Rina Dechter, Irina Rish:
A Scheme for Approximating Probabilistic Inference. UAI 1997: 132-141 - 1996
- [j20]Rina Dechter, Avi Dechter:
Structure-Driven Algorithms for Truth Maintenance. Artif. Intell. 82(1-2): 1-2 (1996) - [j19]Rachel Ben-Eliyahu, Rina Dechter:
Default Reasoning Using Classical Logic. Artif. Intell. 84(1-2): 113-150 (1996) - [j18]Itay Meiri, Rina Dechter, Judea Pearl:
Uncovering Trees in Constraint Networks. Artif. Intell. 86(2): 245-267 (1996) - [j17]Rachel Ben-Eliyahu, Rina Dechter:
On Computing Minimal Models. Ann. Math. Artif. Intell. 18(1): 3-27 (1996) - [j16]Rina Dechter:
Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints. ACM Comput. Surv. 28(4es): 61 (1996) - [c37]Kalev Kask, Rina Dechter:
A Graph-Based Method for Improving GSAT. AAAI/IAAI, Vol. 1 1996: 350-355 - [c36]Daniel Frost, Rina Dechter:
Looking at Full Looking Ahead. CP 1996: 539-540 - [c35]Irina Rish, Rina Dechter:
To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). CP 1996: 555-556 - [c34]Eddie Schwalb, Rina Dechter:
Processing Disjunctions of Temporal Constraints. TIME 1996: 30-35 - [c33]Rina Dechter:
Bucket elimination: A unifying framework for probabilistic inference. UAI 1996: 211-219 - [c32]Rina Dechter:
Topological parameters for time-space tradeoff. UAI 1996: 220-227 - [c31]Yousri El Fattah, Rina Dechter:
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. UAI 1996: 244-251 - [c30]Judea Pearl, Rina Dechter:
Identifying Independencies in Causal Graphs with Feedback. UAI 1996: 420-426 - 1995
- [j15]Peter van Beek, Rina Dechter:
On the Minimality and Decomposability of Row-Convex Constraint Networks. J. ACM 42(3): 543-561 (1995) - [j14]Gadi Pinkas, Rina Dechter:
Improving Connectionist Energy Minimization. J. Artif. Intell. Res. 3: 223-248 (1995) - [c29]Rina Dechter, Peter van Beek:
Local and Global Relational Consistency. CP 1995: 240-257 - [c28]Daniel Frost, Rina Dechter:
Look-Ahead Value Ordering for Constraint Satisfaction Problems. IJCAI (1) 1995: 572-578 - [c27]Kalev Kask, Rina Dechter:
GSAT and Local Consistency. IJCAI (1) 1995: 616-623 - [c26]Yousri El Fattah, Rina Dechter:
Diagnosing Tree-Decomposable Circuits. IJCAI 1995: 1742-1749 - [c25]Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang:
Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995: 2027-2032 - [i1]Gadi Pinkas, Rina Dechter:
Improving Connectionist Energy Minimization. CoRR abs/cs/9510102 (1995) - 1994
- [j13]Rina Dechter, Itay Meiri:
Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. Artif. Intell. 68(2): 211-241 (1994) - [j12]Rachel Ben-Eliyahu, Rina Dechter:
Propositional Semantics for Disjunctive Logic Programs. Ann. Math. Artif. Intell. 12(1-2): 53-87 (1994) - [c24]Daniel Frost, Rina Dechter:
Dead-End Driven Learning. AAAI 1994: 294-300 - [c23]Daniel Frost, Rina Dechter:
In Search of the Best Constraint Satisfaction Search. AAAI 1994: 301-306 - [c22]Eddie Schwalb, Kalev Kask, Rina Dechter:
Temporal Reasoning with Constraints on Fluents and Events. AAAI 1994: 1067-1072 - [c21]Rina Dechter, Irina Rish:
Directional Resolution: The Davis-Putnam Procedure, Revisited. KR 1994: 134-145 - [c20]Peter van Beek, Rina Dechter:
Constraint Tightness versus Global Consistency. KR 1994: 572-582 - 1993
- [c19]Rachel Ben-Eliyahu, Rina Dechter:
On Computing Minimal Models. AAAI 1993: 2-8 - [c18]Eddie Schwalb, Rina Dechter:
Coping With Disjunctions in Temporal Constraint Satisfaction Problems. AAAI 1993: 127-132 - 1992
- [j11]Rina Dechter:
From Local to Global Consistency. Artif. Intell. 55(1): 87-108 (1992) - [j10]Rina Dechter, Judea Pearl:
Structure Identification in Relational Data. Artif. Intell. 58(1-3): 237-270 (1992) - [c17]Gadi Pinkas, Rina Dechter:
An Improved Connectionist Activation Function for Energy Minimization. AAAI 1992: 434-439 - [c16]Rachel Ben-Eliyahu, Rina Dechter:
Propositional Sematics for Disjunctive Logic Programs. JICSLP 1992: 813-827 - 1991
- [j9]Rina Dechter, Itay Meiri, Judea Pearl:
Temporal Constraint Networks. Artif. Intell. 49(1-3): 61-95 (1991) - [c15]Rachel Ben-Eliyahu, Rina Dechter:
Default Logic, Propositional Logic, and Constraints. AAAI 1991: 379-385 - [c14]Zeev Collin, Rina Dechter, Shmuel Katz:
On the Feasibility of Distributed Constraint Satisfaction. IJCAI 1991: 318-324 - [c13]Rina Dechter, Judea Pearl:
Directed Constraint Networks: A Relational Framework for Causal Modeling. IJCAI 1991: 1164-1170 - 1990
- [j8]Rina Dechter:
Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artif. Intell. 41(3): 273-312 (1990) - [j7]Rina Dechter:
Decomposing a Relation into a Tree of Binary Relations. J. Comput. Syst. Sci. 41(1): 2-24 (1990) - [c12]Itay Meiri, Judea Pearl, Rina Dechter:
Tree Decomposition with Applications to Constraint Processing. AAAI 1990: 10-16 - [c11]Rina Dechter:
On the Expressiveness of Networks with Hidden Variables. AAAI 1990: 556-562
1980 – 1989
- 1989
- [j6]Rina Dechter, Judea Pearl:
Tree Clustering for Constraint Networks. Artif. Intell. 38(3): 353-366 (1989) - [j5]Avi Dechter, Rina Dechter:
On the Greedy Solution of Ordering Problems. INFORMS J. Comput. 1(3): 181-189 (1989) - [c10]Judea Pearl, Rina Dechter:
Learning Structure from Data: A Survey. COLT 1989: 230-244 - [c9]Rina Dechter, Itay Meiri:
Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. IJCAI 1989: 271-277 - [c8]Rina Dechter, Itay Meiri, Judea Pearl:
Temporal Constraint Networks. KR 1989: 83-93 - 1988
- [c7]Rina Dechter, Avi Dechter:
Belief Maintenance in Dynamic Constraint Networks. AAAI 1988: 37-42 - [c6]Rina Dechter, Judea Pearl:
Tree-Clustering Schemes for Constraint-Processing. AAAI 1988: 150-154 - 1987
- [j4]Rina Dechter, Judea Pearl:
Network-Based Heuristics for Constraint-Satisfaction Problems. Artif. Intell. 34(1): 1-38 (1987) - [c5]Avi Dechter, Rina Dechter:
Removing Redundancies in Constraint Networks. AAAI 1987: 105-109 - [c4]Rina Dechter:
Decomposing an N-ary Relation into a Tree of Binary Relations. PODS 1987: 185-189 - 1986
- [j3]Rina Dechter, Leonard Kleinrock:
Broadcast Communications and Distributed Algorithms. IEEE Trans. Computers 35(3): 210-219 (1986) - [c3]Rina Dechter:
Learning While Searching in Constraint-Satisfaction-Problems. AAAI 1986: 178-185 - 1985
- [j2]Rina Dechter, Judea Pearl:
Generalized Best-First Search Strategies and the Optimality of A*. J. ACM 32(3): 505-536 (1985) - [c2]Rina Dechter, Judea Pearl:
The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. IJCAI 1985: 1066-1072 - 1983
- [c1]Rina Dechter, Judea Pearl:
The Optimality of A* Revisited. AAAI 1983: 95-99 - 1980
- [j1]Nam Huyn, Rina Dechter, Judea Pearl:
Probabilistic Analysis of the Complexity of A*. Artif. Intell. 15(3): 241-254 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
