2005 |
16 | 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 |
15 | EE | Kalev Kask,
Rina Dechter,
Vibhav Gogate:
New Look-Ahead Schemes for Constraint Satisfaction.
AMAI 2004 |
14 | EE | Kalev Kask,
Rina Dechter,
Vibhav Gogate:
Counting-Based Look-Ahead Schemes for Constraint Satisfaction.
CP 2004: 317-331 |
2003 |
13 | | Radu Marinescu,
Kalev Kask,
Rina Dechter:
Systematic vs. Non-systematic Algorithms for Solving the MPE Task.
UAI 2003: 394-402 |
2002 |
12 | | Rina Dechter,
Kalev Kask,
Eyal Bin,
Roy Emek:
Generating Random Solutions for Constraint Satisfaction Problems.
AAAI/IAAI 2002: 15-21 |
11 | | Robert Mateescu,
Rina Dechter,
Kalev Kask:
Tree Approximation for Belief Updating.
AAAI/IAAI 2002: 553-559 |
10 | | Rina Dechter,
Kalev Kask,
Robert Mateescu:
Iterative Join-Graph Propagation.
UAI 2002: 128-136 |
2001 |
9 | EE | Rina Dechter,
Kalev Kask,
Javier Larrosa:
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization.
CP 2001: 346-360 |
8 | 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 |
7 | EE | Kalev Kask:
New Search Heuristics for Max-CSP.
CP 2000: 262-277 |
1999 |
6 | | Kalev Kask,
Rina Dechter:
Branch and Bound with Mini-Bucket Heuristics.
IJCAI 1999: 426-435 |
5 | EE | Kalev Kask,
Rina Dechter:
Mini-Bucket Heuristics for Improved Search.
UAI 1999: 314-323 |
1998 |
4 | EE | Irina Rish,
Kalev Kask,
Rina Dechter:
Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding.
UAI 1998: 455-463 |
1996 |
3 | | Kalev Kask,
Rina Dechter:
A Graph-Based Method for Improving GSAT.
AAAI/IAAI, Vol. 1 1996: 350-355 |
1995 |
2 | | Kalev Kask,
Rina Dechter:
GSAT and Local Consistency.
IJCAI (1) 1995: 616-623 |
1994 |
1 | | Eddie Schwalb,
Kalev Kask,
Rina Dechter:
Temporal Reasoning with Constraints on Fluents and Events.
AAAI 1994: 1067-1072 |