☰

Rina Dechter - Publications

Affiliations: 
Information and Computer Science - Ph.D. University of California, Irvine, Irvine, CA 
Area:
Artificial Intelligence, Computer Science, Statistics
Tree Info Similar researchers PubMed Report error

56 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Marinescu R, Kishimoto A, Botea A, Dechter R, Ihler A. Anytime Recursive Best-First Search for Bounding Marginal MAP Proceedings of the Aaai Conference On Artificial Intelligence. 33: 7924-7932. DOI: 10.1609/aaai.v33i01.33017924  0.624
2019 Lou Q, Dechter R, Ihler A. Interleave Variational Optimization with Monte Carlo Sampling: A Tale of Two Approximate Inference Paradigms Proceedings of the Aaai Conference On Artificial Intelligence. 33: 7900-7907. DOI: 10.1609/AAAI.V33I01.33017900  0.356
2018 Marinescu R, Lee J, Dechter R, Ihler A. AND/OR Search for Marginal MAP Journal of Artificial Intelligence Research. 63: 875-921. DOI: 10.1613/Jair.1.11265  0.662
2018 Lam W, Kask K, Larrosa J, Dechter R. Subproblem ordering heuristics for AND/OR best-first search Journal of Computer and System Sciences. 94: 41-62. DOI: 10.1016/J.Jcss.2017.10.003  0.673
2017 Lam W, Kask K, Larrosa J, Dechter R. Residual-Guided Look-Ahead in AND/OR Search for Graphical Models Journal of Artificial Intelligence Research. 60: 287-346. DOI: 10.1613/Jair.5475  0.657
2017 Otten L, Dechter R. AND/OR Branch-and-Bound on a Computational Grid Journal of Artificial Intelligence Research. 59: 351-435. DOI: 10.1613/Jair.5456  0.772
2017 Fioretto F, Pontelli E, Yeoh W, Dechter R. Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs Constraints. 23: 1-43. DOI: 10.1007/S10601-017-9274-1  0.452
2016 Flerova N, Marinescu R, Dechter R. Searching for the M Best Solutions in Graphical Models Journal of Artificial Intelligence Research. 55: 889-952. DOI: 10.1613/Jair.4985  0.655
2016 Flerova N, Marinescu R, Dechter R. Weighted heuristic anytime search: new schemes for optimization over graphical models Annals of Mathematics and Artificial Intelligence. 1-52. DOI: 10.1007/S10472-015-9495-1  0.663
2013 Silberstein M, Weissbrod O, Otten L, Tzemach A, Anisenia A, Shtark O, Tuberg D, Galfrin E, Gannon I, Shalata A, Borochowitz ZU, Dechter R, Thompson E, Geiger D. A system for exact and approximate genetic linkage analysis of SNP data in large pedigrees. Bioinformatics (Oxford, England). 29: 197-205. PMID 23162081 DOI: 10.1093/Bioinformatics/Bts658  0.721
2012 Gogate V, Dechter R. Importance sampling-based estimation over AND/OR search spaces for graphical models Artificial Intelligence. 184: 38-77. DOI: 10.1016/J.Artint.2012.03.001  0.781
2011 Otten L, Dechter R. Finding most likely haplotypes in general pedigrees through parallel search with dynamic load balancing. Pacific Symposium On Biocomputing. Pacific Symposium On Biocomputing. 26-37. PMID 21121030  0.777
2011 Gogate V, Dechter R. Sampling-based lower bounds for counting queries Intelligenza Artificiale. 5: 171-188. DOI: 10.3233/Ia-2011-0026  0.808
2011 Gogate V, Dechter R. SampleSearch: Importance sampling in presence of determinism Artificial Intelligence. 175: 694-729. DOI: 10.1016/J.Artint.2010.10.009  0.801
2010 Marinescu R, Dechter R. Evaluating the impact of AND/OR search on 0-1 integer linear programming. Constraints : An International Journal. 15: 29-63. PMID 21052484 DOI: 10.1007/S10601-009-9070-7  0.681
2010 Mateescu R, Kask K, Gogate V, Dechter R. Join-Graph Propagation Algorithms. The Journal of Artificial Intelligence Research. 37: 279-328. PMID 20740057 DOI: 10.1613/Jair.2842  0.746
2010 Bidyuk B, Dechter R, Rollon E. Active Tuples-based Scheme for Bounding Posterior Beliefs Journal of Artificial Intelligence Research. 39: 335-371. DOI: 10.1613/Jair.2945  0.428
2009 Marinescu R, Dechter R. Memory intensive AND/OR search for combinatorial optimization in graphical models Artificial Intelligence. 173: 1492-1524. DOI: 10.1016/J.Artint.2009.07.004  0.695
2009 Marinescu R, Dechter R. AND/OR Branch-and-Bound search for combinatorial optimization in graphical models Artificial Intelligence. 173: 1457-1491. DOI: 10.1016/J.Artint.2009.07.003  0.698
2008 Mateescu R, Dechter R. Mixed deterministic and probabilistic networks. Annals of Mathematics and Artificial Intelligence. 54: 3-51. PMID 20981243 DOI: 10.1007/S10472-009-9132-Y  0.793
2008 Mateescu R, Dechter R, Marinescu R. AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models Journal of Artificial Intelligence Research. 33: 465-519. DOI: 10.1613/Jair.2605  0.774
2007 Bidyuk B, Dechter R. Cutset Sampling for Bayesian Networks Journal of Artificial Intelligence Research. 28: 1-48. DOI: 10.1613/Jair.2149  0.769
2007 Dechter R, Mateescu R. AND/OR search spaces for graphical models Artificial Intelligence. 171: 73-106. DOI: 10.1016/J.Artint.2006.11.003  0.797
2005 Kask K, Dechter R, Larrosa J, Dechter A. Unifying tree decompositions for reasoning in graphical models Artificial Intelligence. 166: 165-193. DOI: 10.1016/J.Artint.2005.04.004  0.675
2005 Marinescu R, Dechter R. AND/OR branch-and-bound for solving mixed integer linear programming problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3709: 857. DOI: 10.1007/11564751_95  0.662
2003 Dechter R, Rish I. Mini-buckets Journal of the Acm. 50: 107-153. DOI: 10.1145/636865.636866  0.517
2003 Larrosa J, Dechter R. Constraints. 8: 303-326. DOI: 10.1023/A:1025627211942  0.449
2003 Bidyuk B, Dechter R. Cycle-cutset sampling for Bayesian networks Lecture Notes in Computer Science. 297-312. DOI: 10.1007/3-540-44886-1_23  0.756
2002 Dechter R, Frost D. Backjump-based backtracking for constraint satisfaction problems Artificial Intelligence. 136: 147-188. DOI: 10.1016/S0004-3702(02)00120-0  0.427
2001 Zhang W, Dechter R, Korf RE. Heuristic search in artificial intelligence Artificial Intelligence. 129: 1-4. DOI: 10.1016/S0004-3702(01)00111-4  0.351
2001 Kask K, Dechter R. A general scheme for automatic generation of search heuristics from specification dependencies Artificial Intelligence. 129: 91-131. DOI: 10.1016/S0004-3702(01)00107-2  0.69
2001 Dechter R, El Fattah Y. Topological parameters for time-space tradeoff Artificial Intelligence. 125: 93-118. DOI: 10.1016/S0004-3702(00)00050-3  0.448
2000 Rish I, Dechter R. Journal of Automated Reasoning. 24: 225-275. DOI: 10.1023/A:1006303512524  0.496
1999 Frost D, Dechter R. Annals of Mathematics and Artificial Intelligence. 26: 149-170. DOI: 10.1023/A:1018906911996  0.416
1999 Dechter R. Bucket elimination: A unifying framework for reasoning Artificial Intelligence. 113: 41-85. DOI: 10.1016/S0004-3702(99)00059-4  0.469
1997 van Beek P, Dechter R. Constraint tightness and looseness versus local and global consistency Journal of the Acm (Jacm). 44: 549-566. DOI: 10.1145/263867.263499  0.358
1997 Dechter R. Constraints. 2: 51-55. DOI: 10.1023/A:1009796922698  0.341
1997 Schwalb E, Dechter R. Processing disjunctions in temporal constraint networks Artificial Intelligence. 93: 29-61. DOI: 10.1016/S0004-3702(97)00009-X  0.455
1996 Dechter R. Bucket elimination Acm Computing Surveys (Csur). 28: 61. DOI: 10.1145/242224.242302  0.358
1996 Meiri I, Dechter R, Pearl J. Uncovering trees in constraint networks Artificial Intelligence. 86: 245-267. DOI: 10.1016/0004-3702(95)00102-6  0.615
1996 Ben-Eliyahu R, Dechter R. Default reasoning using classical logic Artificial Intelligence. 84: 113-150. DOI: 10.1016/0004-3702(95)00095-X  0.353
1996 Dechter R, Dechter A. Structure-driven algorithms for truth maintenance Artificial Intelligence. 82: 1-20. DOI: 10.1016/0004-3702(94)00096-4  0.456
1995 Pinkas G, Dechter R. Improving Connectionist Energy Minimization Journal of Artificial Intelligence Research. 3: 223-248. DOI: 10.1613/Jair.130  0.478
1995 van Beek P, Dechter R. On the minimality and global consistency of row-convex constraint networks Journal of the Acm (Jacm). 42: 543-561. DOI: 10.1145/210346.210347  0.419
1994 Dechter R, Meiri I. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems Artificial Intelligence. 68: 211-241. DOI: 10.1016/0004-3702(94)90068-X  0.455
1994 Ben-Eliyahu R, Dechter R. Propositional semantics for disjunctive logic programs Annals of Mathematics and Artificial Intelligence. 12: 53-87. DOI: 10.1007/Bf01530761  0.314
1992 Dechter R. From local to global consistency Artificial Intelligence. 55: 87-107. DOI: 10.1016/0004-3702(92)90043-W  0.387
1992 Dechter R, Pearl J. Structure identification in relational data Artificial Intelligence. 58: 237-270. DOI: 10.1016/0004-3702(92)90009-M  0.563
1991 Dechter R, Meiri I, Pearl J. Temporal constraint networks Artificial Intelligence. 49: 61-95. DOI: 10.1016/0004-3702(91)90006-6  0.609
1990 Dechter R. Decomposing a relation into a tree of binary relations Journal of Computer and System Sciences. 41: 2-24. DOI: 10.1016/0022-0000(90)90031-F  0.402
1990 Dechter R. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition Artificial Intelligence. 41: 273-312. DOI: 10.1016/0004-3702(90)90046-3  0.41
1989 Dechter A, Dechter R. On the Greedy Solution of Ordering Problems Orsa Journal On Computing. 1: 181-189. DOI: 10.1287/Ijoc.1.3.181  0.374
1989 Dechter R, Pearl J. Tree clustering for constraint networks Artificial Intelligence. 38: 353-366. DOI: 10.1016/0004-3702(89)90037-4  0.58
1987 Dechter R, Pearl J. Network-based heuristics for constraint-satisfaction problems Artificial Intelligence. 34: 1-38. DOI: 10.1016/0004-3702(87)90002-6  0.618
1985 Dechter R, Pearl J. Generalized best-first search strategies and the optimality of A* Journal of the Acm (Jacm). 32: 505-536. DOI: 10.1145/3828.3830  0.587
1980 Huyn N, Dechter R, Pearl J. Probabilistic analysis of the complexity of A∗ Artificial Intelligence. 15: 241-254. DOI: 10.1016/0004-3702(80)90045-4  0.524
Show low-probability matches.