| * | 2008 |
|---|
| 15 | EE | Robert Mateescu,
Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Networks.
Concurrency, Graphs and Models 2008: 238-257 |
| 14 | EE | Robert Mateescu,
Rina Dechter:
Mixed deterministic and probabilistic networks.
Ann. Math. Artif. Intell. 54(1-3): 3-51 (2008) |
| 13 | EE | Robert 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 |
|---|
| 12 | EE | Robert Mateescu,
Radu Marinescu,
Rina Dechter:
AND/OR Multi-valued Decision Diagrams for Constraint Optimization.
CP 2007: 498-513 |
| 11 | EE | Robert Mateescu,
Rina Dechter:
A Comparison of Time-Space Schemes for Graphical Models.
IJCAI 2007: 2346-2352 |
| 10 | EE | Rina Dechter,
Robert Mateescu:
AND/OR search spaces for graphical models.
Artif. Intell. 171(2-3): 73-106 (2007) |
| 2006 |
|---|
| 9 | EE | Robert Mateescu,
Rina Dechter:
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs).
CP 2006: 329-343 |
| 2005 |
|---|
| 8 | EE | Robert Mateescu,
Rina Dechter:
AND/OR Search Spaces and the Semantic Width of Constraint Networks.
CP 2005: 860 |
| 7 | EE | Robert Mateescu,
Rina Dechter:
AND/OR Cutset Conditioning.
IJCAI 2005: 230-235 |
| 6 | EE | Robert Mateescu,
Rina Dechter:
The Relationship Between AND/OR Search and Variable Elimination.
UAI 2005: 380-387 |
| 2004 |
|---|
| 5 | EE | Rina Dechter,
Robert Mateescu:
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting.
CP 2004: 731-736 |
| 4 | EE | Rina Dechter,
Robert Mateescu:
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space.
UAI 2004: 120-129 |
| 2003 |
|---|
| 3 | | Rina Dechter,
Robert Mateescu:
A Simple Insight into Iterative Belief Propagation's Success.
UAI 2003: 175-183 |
| 2002 |
|---|
| 2 | | Robert Mateescu,
Rina Dechter,
Kalev Kask:
Tree Approximation for Belief Updating.
AAAI/IAAI 2002: 553-559 |
| 1 | | Rina Dechter,
Kalev Kask,
Robert Mateescu:
Iterative Join-Graph Propagation.
UAI 2002: 128-136 |
