dblp.uni-trier.dewww.uni-trier.de

Rina Dechter Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
133EERadu Marinescu, Rina Dechter: AND/OR Branch-and-Bound search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1457-1491 (2009)
132EERadu Marinescu, Rina Dechter: Memory intensive AND/OR search for combinatorial optimization in graphical models. Artif. Intell. 173(16-17): 1492-1524 (2009)
2008
131 Vibhav Gogate, Rina Dechter: Studies in Solution Sampling. AAAI 2008: 271-276
130EEVibhav Gogate, Rina Dechter: Approximate Solution Sampling (and Counting) on AND/OR Spaces. CP 2008: 534-538
129EELars Otten, Rina Dechter: Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems. CP 2008: 576-581
128EEMaria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter: Robust Solutions in Unstable Optimization Problems. CSCLP 2008: 116-131
127EERobert Mateescu, Rina Dechter: AND/OR Multi-valued Decision Diagrams for Constraint Networks. Concurrency, Graphs and Models 2008: 238-257
126EERina Dechter, Lars Otten, Radu Marinescu: On the Practical Significance of Hypertree vs. TreeWidth. ECAI 2008: 913-914
125EEVibhav Gogate, Rina Dechter: AND/OR Importance Sampling. UAI 2008: 212-219
124EELars Otten, Rina Dechter: Bounding Search Space Size via (Hyper)tree Decompositions. UAI 2008: 452-459
123EERobert Mateescu, Rina Dechter: Mixed deterministic and probabilistic networks. Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008)
122EERobert Mateescu, Rina Dechter, Radu Marinescu: AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models. J. Artif. Intell. Res. (JAIR) 33: 465-519 (2008)
2007
121 Radu Marinescu, Rina Dechter: Best-First AND/OR Search for Graphical Models. AAAI 2007: 1171-1176
120 Vibhav Gogate, Rina Dechter: Approximate Counting by Sampling the Backtrack-free Search Space. AAAI 2007: 198-203
119EERobert Mateescu, Radu Marinescu, Rina Dechter: AND/OR Multi-valued Decision Diagrams for Constraint Optimization. CP 2007: 498-513
118EERadu Marinescu, Rina Dechter: Best-First AND/OR Search for 0/1 Integer Programming. CPAIOR 2007: 171-185
117EERobert Mateescu, Rina Dechter: A Comparison of Time-Space Schemes for Graphical Models. IJCAI 2007: 2346-2352
116EERina Dechter, Robert Mateescu: AND/OR search spaces for graphical models. Artif. Intell. 171(2-3): 73-106 (2007)
115EEBozhena Bidyuk, Rina Dechter: Cutset Sampling for Bayesian Networks. J. Artif. Intell. Res. (JAIR) 28: 1-48 (2007)
2006
114 Bozhena Bidyuk, Rina Dechter: An Anytime Scheme for Bounding Posterior Beliefs. AAAI 2006
113 Radu Marinescu, Rina Dechter: Memory Intensive Branch-and-Bound Search for Graphical Models. AAAI 2006
112EERobert Mateescu, Rina Dechter: Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). CP 2006: 329-343
111EEVibhav Gogate, Rina Dechter: A New Algorithm for Sampling CSP Solutions Uniformly at Random. CP 2006: 711-715
110EERadu Marinescu, Rina Dechter: AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. CPAIOR 2006: 152-166
109 Radu Marinescu, Rina Dechter: Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. ECAI 2006: 138-142
108 Bozhena Bidyuk, Rina Dechter: Improving Bound Propagation. ECAI 2006: 342-346
107EEBozhena Bidyuk, Rina Dechter: Cutset Sampling with Likelihood Weighting. UAI 2006
2005
106EERadu Marinescu, Rina Dechter: AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. CP 2005: 857
105EERobert Mateescu, Rina Dechter: AND/OR Search Spaces and the Semantic Width of Constraint Networks. CP 2005: 860
104EERadu Marinescu, Rina Dechter: AND/OR Branch-and-Bound for Graphical Models. IJCAI 2005: 224-229
103EERobert Mateescu, Rina Dechter: AND/OR Cutset Conditioning. IJCAI 2005: 230-235
102EEVibhav Gogate, Rina Dechter: Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints. UAI 2005: 209-216
101EEVibhav Gogate, Rina Dechter, Bozhena Bidyuk, Craig Rindt, James Marca: Modeling Transportation Routines using Hybrid Dynamic Mixed Networks. UAI 2005: 217-224
100EERobert Mateescu, Rina Dechter: The Relationship Between AND/OR Search and Variable Elimination. UAI 2005: 380-387
99EEKalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter: Unifying tree decompositions for reasoning in graphical models. Artif. Intell. 166(1-2): 165-193 (2005)
2004
98EEKalev Kask, Rina Dechter, Vibhav Gogate: New Look-Ahead Schemes for Constraint Satisfaction. AMAI 2004
97EEKalev Kask, Rina Dechter, Vibhav Gogate: Counting-Based Look-Ahead Schemes for Constraint Satisfaction. CP 2004: 317-331
96EERina Dechter, Robert Mateescu: The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting. CP 2004: 731-736
95EERina Dechter: Constraints and Probabilistic Networks: A Look At The Interface. LPNMR 2004: 1
94EERina Dechter, Robert Mateescu: Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space. UAI 2004: 120-129
93EEVibhav Gogate, Rina Dechter: A Complete Anytime Algorithm for Treewidth. UAI 2004: 201-208
92EEBozhena Bidyuk, Rina Dechter: On Finding Minimal w-cutset. UAI 2004: 43-50
2003
91EEBozhena Bidyuk, Rina Dechter: Cycle-Cutset Sampling for Bayesian Networks. Canadian Conference on AI 2003: 297-312
90 Rina Dechter, Robert Mateescu: A Simple Insight into Iterative Belief Propagation's Success. UAI 2003: 175-183
89 Bozhena Bidyuk, Rina Dechter: An Empirical Study of w-Cutset Sampling for Bayesian Networks. UAI 2003: 37-46
88 Radu Marinescu, Kalev Kask, Rina Dechter: Systematic vs. Non-systematic Algorithms for Solving the MPE Task. UAI 2003: 394-402
87EERina Dechter: Guest Editorial. Constraints 8(3): 227-228 (2003)
86EEJavier Larrosa, Rina Dechter: Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints 8(3): 303-326 (2003)
85EERina Dechter, Irina Rish: Mini-buckets: A general scheme for bounded inference. J. ACM 50(2): 107-153 (2003)
2002
84 Rina Dechter, Kalev Kask, Eyal Bin, Roy Emek: Generating Random Solutions for Constraint Satisfaction Problems. AAAI/IAAI 2002: 15-21
83 Robert Mateescu, Rina Dechter, Kalev Kask: Tree Approximation for Belief Updating. AAAI/IAAI 2002: 553-559
82 Rina Dechter, Kalev Kask, Robert Mateescu: Iterative Join-Graph Propagation. UAI 2002: 128-136
81EERina Dechter, Daniel Frost: Backjump-based backtracking for constraint satisfaction problems. Artif. Intell. 136(2): 147-188 (2002)
2001
80EERina Dechter, Kalev Kask, Javier Larrosa: A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. CP 2001: 346-360
79EERina Dechter, David Larkin: Hybrid Processing of Beliefs and Constraints. UAI 2001: 112-119
78EERina Dechter, Yousri El Fattah: Topological parameters for time-space tradeoff. Artif. Intell. 125(1-2): 93-118 (2001)
77EEWeixiong Zhang, Rina Dechter, Richard E. Korf: Heuristic search in artificial intelligence. Artif. Intell. 129(1-2): 1-4 (2001)
76EEKalev Kask, Rina Dechter: A general scheme for automatic generation of search heuristics from specification dependencies. Artif. Intell. 129(1-2): 91-131 (2001)
2000
75 Rina Dechter: Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings Springer 2000
74 Robert Menke, Rina Dechter: An Implementation of the Combinatorial Auction Problem in ECLiPSe. AAAI/IAAI 2000: 1084
73 Rina Dechter: A New Perspective on Algorithms for Optimizing Policies under Uncertainty. AIPS 2000: 72-81
72 Irina Rish, Rina Dechter: Resolution versus Search: Two Strategies for SAT. J. Autom. Reasoning 24(1/2): 225-275 (2000)
1999
71 Kalev Kask, Rina Dechter: Branch and Bound with Mini-Bucket Heuristics. IJCAI 1999: 426-435
70EEKalev Kask, Rina Dechter: Mini-Bucket Heuristics for Improved Search. UAI 1999: 314-323
69 Daniel Frost, Rina Dechter: Maintenance scheduling problems as benchmarks for constraint algorithms. Ann. Math. Artif. Intell. 26(1-4): 149-170 (1999)
68EERina Dechter: Bucket Elimination: A Unifying Framework for Reasoning. Artif. Intell. 113(1-2): 41-85 (1999)
67EEZeev Collin, Rina Dechter, Shmuel Katz: Self-Stabilizing Distributed Constraint Satisfaction. Chicago J. Theor. Comput. Sci. 1999: (1999)
1998
66EEDaniel Frost, Rina Dechter: Optimizing with Constraints: A Case Study in Scheduling Maintenance of Electric Power Units. CP 1998: 469
65EEIrina Rish, Kalev Kask, Rina Dechter: Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding. UAI 1998: 455-463
1997
64 Rina Dechter: Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. IJCAI 1997: 1297-1303
63EEArun K. Jagota, Rina Dechter: Simple distributed algorithms for the cycle cutset problem. SAC 1997: 366-373
62EERina Dechter, Irina Rish: A Scheme for Approximating Probabilistic Inference. UAI 1997: 132-141
61EEEddie Schwalb, Rina Dechter: Processing Disjunctions in Temporal Constraint Networks. Artif. Intell. 93: 29-61 (1997)
60 Rina Dechter: Bucket Elimination: a Unifying Framework for Processing Hard and Soft Constraints. Constraints 2(1): 51-55 (1997)
59EEPeter van Beek, Rina Dechter: Constraint tightness and looseness versus local and global consistency. J. ACM 44(4): 549-566 (1997)
58EERina Dechter, Peter van Beek: Local and Global Relational Consistency. Theor. Comput. Sci. 173(1): 283-308 (1997)
1996
57 Kalev Kask, Rina Dechter: A Graph-Based Method for Improving GSAT. AAAI/IAAI, Vol. 1 1996: 350-355
56 Daniel Frost, Rina Dechter: Looking at Full Looking Ahead. CP 1996: 539-540
55 Irina Rish, Rina Dechter: To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract). CP 1996: 555-556
54 Eddie Schwalb, Rina Dechter: Processing Disjunctions of Temporal Constraints. TIME 1996
53EERina Dechter: Bucket elimination: A unifying framework for probabilistic inference. UAI 1996: 211-219
52EERina Dechter: Topological parameters for time-space tradeoff. UAI 1996: 220-227
51EEYousri El Fattah, Rina Dechter: An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits. UAI 1996: 244-251
50EEJudea Pearl, Rina Dechter: Identifying Independencies in Causal Graphs with Feedback. UAI 1996: 420-426
49 Rina Dechter: Bucket Elimination: A Unifying Framework for Processing Hard and Soft Constraints. ACM Comput. Surv. 28(4es): 61 (1996)
48 Rachel Ben-Eliyahu, Rina Dechter: On Computing Minimal Models. Ann. Math. Artif. Intell. 18(1): 3-27 (1996)
47EERina Dechter, Avi Dechter: Structure-Driven Algorithms for Truth Maintenance. Artif. Intell. 82(1-2): 1-2 (1996)
46EERachel Ben-Eliyahu, Rina Dechter: Default Reasoning Using Classical Logic. Artif. Intell. 84(1-2): 113-150 (1996)
45EEItay Meiri, Rina Dechter, Judea Pearl: Uncovering Trees in Constraint Networks. Artif. Intell. 86(2): 245-267 (1996)
1995
44 Rina Dechter, Peter van Beek: Local and Global Relational Consistency. CP 1995: 240-257
43 Yousri El Fattah, Rina Dechter: Diagnosing Tree-Decomposable Circuits. IJCAI 1995: 1742-1749
42 Eugene C. Freuder, Rina Dechter, Matthew L. Ginsberg, Bart Selman, Edward P. K. Tsang: Systematic Versus Stochastic Constraint Satisfaction. IJCAI 1995: 2027-2032
41 Daniel Frost, Rina Dechter: Look-Ahead Value Ordering for Constraint Satisfaction Problems. IJCAI (1) 1995: 572-578
40 Kalev Kask, Rina Dechter: GSAT and Local Consistency. IJCAI (1) 1995: 616-623
39EEPeter van Beek, Rina Dechter: On the Minimality and Decomposability of Row-Convex Constraint Networks. J. ACM 42(3): 543-561 (1995)
38 Gadi Pinkas, Rina Dechter: Improving Connectionist Energy Minimization. J. Artif. Intell. Res. (JAIR) 3: 223-248 (1995)
1994
37 Eddie Schwalb, Kalev Kask, Rina Dechter: Temporal Reasoning with Constraints on Fluents and Events. AAAI 1994: 1067-1072
36 Daniel Frost, Rina Dechter: Dead-End Driven Learning. AAAI 1994: 294-300
35 Daniel Frost, Rina Dechter: In Search of the Best Constraint Satisfaction Search. AAAI 1994: 301-306
34 Rina Dechter, Irina Rish: Directional Resolution: The Davis-Putnam Procedure, Revisited. KR 1994: 134-145
33 Peter van Beek, Rina Dechter: Constraint Tightness versus Global Consistency. KR 1994: 572-582
32 Rachel Ben-Eliyahu, Rina Dechter: Propositional Semantics for Disjunctive Logic Programs. Ann. Math. Artif. Intell. 12(1-2): 53-87 (1994)
31 Rina Dechter, Itay Meiri: Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems. Artif. Intell. 68(2): 211-241 (1994)
1993
30 Eddie Schwalb, Rina Dechter: Coping With Disjunctions in Temporal Constraint Satisfaction Problems. AAAI 1993: 127-132
29 Rachel Ben-Eliyahu, Rina Dechter: On Computing Minimal Models. AAAI 1993: 2-8
1992
28 Gadi Pinkas, Rina Dechter: An Improved Connectionist Activation Function for Energy Minimization. AAAI 1992: 434-439
27 Rachel Ben-Eliyahu, Rina Dechter: Propositional Sematics for Disjunctive Logic Programs. JICSLP 1992: 813-827
26 Rina Dechter: From Local to Global Consistency. Artif. Intell. 55(1): 87-108 (1992)
25 Rina Dechter, Judea Pearl: Structure Identification in Relational Data. Artif. Intell. 58(1-3): 237-270 (1992)
1991
24 Rachel Ben-Eliyahu, Rina Dechter: Default Logic, Propositional Logic, and Constraints. AAAI 1991: 379-385
23 Rina Dechter, Judea Pearl: Directed Constraint Networks: A Relational Framework for Causal Modeling. IJCAI 1991: 1164-1170
22 Zeev Collin, Rina Dechter, Shmuel Katz: On the Feasibility of Distributed Constraint Satisfaction. IJCAI 1991: 318-324
21 Rina Dechter, Itay Meiri, Judea Pearl: Temporal Constraint Networks. Artif. Intell. 49(1-3): 61-95 (1991)
1990
20 Itay Meiri, Judea Pearl, Rina Dechter: Tree Decomposition with Applications to Constraint Processing. AAAI 1990: 10-16
19 Rina Dechter: On the Expressiveness of Networks with Hidden Variables. AAAI 1990: 556-562
18 Rina Dechter: Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition. Artif. Intell. 41(3): 273-312 (1990)
17 Rina Dechter: Decomposing a Relation into a Tree of Binary Relations. J. Comput. Syst. Sci. 41(1): 2-24 (1990)
1989
16EEJudea Pearl, Rina Dechter: Learning Structure from Data: A Survey. COLT 1989: 230-244
15 Rina Dechter, Itay Meiri: Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems. IJCAI 1989: 271-277
14 Rina Dechter, Itay Meiri, Judea Pearl: Temporal Constraint Networks. KR 1989: 83-93
13 Rina Dechter, Judea Pearl: Tree Clustering for Constraint Networks. Artif. Intell. 38(3): 353-366 (1989)
12EEAvi Dechter, Rina Dechter: On the Greedy Solution of Ordering Problems. INFORMS Journal on Computing 1(3): 181-189 (1989)
1988
11 Rina Dechter, Judea Pearl: Tree-Clustering Schemes for Constraint-Processing. AAAI 1988: 150-154
10 Rina Dechter, Avi Dechter: Belief Maintenance in Dynamic Constraint Networks. AAAI 1988: 37-42
1987
9 Avi Dechter, Rina Dechter: Removing Redundancies in Constraint Networks. AAAI 1987: 105-109
8EERina Dechter: Decomposing an N-ary Relation into a Tree of Binary Relations. PODS 1987: 185-189
7 Rina Dechter, Judea Pearl: Network-Based Heuristics for Constraint-Satisfaction Problems. Artif. Intell. 34(1): 1-38 (1987)
1986
6 Rina Dechter: Learning While Searching in Constraint-Satisfaction-Problems. AAAI 1986: 178-185
5 Rina Dechter, Leonard Kleinrock: Broadcast Communications and Distributed Algorithms. IEEE Trans. Computers 35(3): 210-219 (1986)
1985
4 Rina Dechter, Judea Pearl: The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation. IJCAI 1985: 1066-1072
3EERina Dechter, Judea Pearl: Generalized Best-First Search Strategies and the Optimality of A* J. ACM 32(3): 505-536 (1985)
1983
2 Rina Dechter, Judea Pearl: The Optimality of A* Revisited. AAAI 1983: 95-99
1980
1 Nam Huyn, Rina Dechter, Judea Pearl: Probabilistic Analysis of the Complexity of A*. Artif. Intell. 15(3): 241-254 (1980)

Coauthor Index

1Peter van Beek [33] [39] [44] [58] [59]
2Rachel Ben-Eliyahu-Zohary (Rachel Ben-Eliyahu) [24] [27] [29] [32] [46] [48]
3Bozhena Bidyuk [89] [91] [92] [101] [107] [108] [114] [115]
4Eyal Bin [84]
5Zeev Collin [22] [67]
6Avi Dechter [9] [10] [12] [47] [99]
7Roy Emek [84]
8Yousri El Fattah [43] [51] [78]
9Eugene C. Freuder [42]
10Daniel Frost [35] [36] [41] [56] [66] [69] [81]
11Matthew L. Ginsberg [42]
12Vibhav Gogate [93] [97] [98] [101] [102] [111] [120] [125] [130] [131]
13Nam Huyn [1]
14Arun K. Jagota [63]
15Kalev Kask [37] [40] [57] [65] [70] [71] [76] [80] [82] [83] [84] [88] [97] [98] [99]
16Shmuel Katz [22] [67]
17Leonard Kleinrock [5]
18Richard E. Korf [77]
19David Larkin [79]
20Javier Larrosa [80] [86] [99]
21James Marca [101]
22Radu Marinescu [88] [104] [106] [109] [110] [113] [118] [119] [121] [122] [126] [132] [133]
23Robert Mateescu [82] [83] [90] [94] [96] [100] [103] [105] [112] [116] [117] [119] [122] [123] [127]
24Itay Meiri [14] [15] [20] [21] [31] [45]
25Robert Menke [74]
26Lars Otten [124] [126] [129]
27Judea Pearl [1] [2] [3] [4] [7] [11] [13] [14] [16] [20] [21] [23] [25] [45] [50]
28Maria Silvia Pini [128]
29Gadi Pinkas [28] [38]
30Craig Rindt [101]
31Irina Rish [34] [55] [62] [65] [72] [85]
32Francesca Rossi [128]
33Eddie Schwalb [30] [37] [54] [61]
34Bart Selman [42]
35Edward P. K. Tsang [42]
36Kristen Brent Venable (Kristen B. Venable) [128]
37Weixiong Zhang [77]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)