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