 | 2008 |
|---|
| 11 |       | Vibhav Gogate,
Rina Dechter:
Studies in Solution Sampling.
AAAI 2008: 271-276 |
| 10 |  | Vibhav Gogate,
Rina Dechter:
Approximate Solution Sampling (and Counting) on AND/OR Spaces.
CP 2008: 534-538 |
| 9 | | Vibhav Gogate,
Rina Dechter:
AND/OR Importance Sampling.
UAI 2008: 212-219 |
| 2007 |
|---|
| 8 | | Vibhav Gogate:
Approximate Inference in Probabilistic Graphical Models with Determinism.
AAAI 2007: 1927-1928 |
| 7 | | Vibhav Gogate,
Rina Dechter:
Approximate Counting by Sampling the Backtrack-free Search Space.
AAAI 2007: 198-203 |
| 2006 |
|---|
| 6 | | Vibhav Gogate,
Rina Dechter:
A New Algorithm for Sampling CSP Solutions Uniformly at Random.
CP 2006: 711-715 |
| 2005 |
|---|
| 5 | | Vibhav Gogate,
Rina Dechter:
Approximate Inference Algorithms for Hybrid Bayesian Networks with Discrete Constraints.
UAI 2005: 209-216 |
| 4 | | Vibhav Gogate,
Rina Dechter,
Bozhena Bidyuk,
Craig Rindt,
James Marca:
Modeling Transportation Routines using Hybrid Dynamic Mixed Networks.
UAI 2005: 217-224 |
| 2004 |
|---|
| 3 | | Kalev Kask,
Rina Dechter,
Vibhav Gogate:
New Look-Ahead Schemes for Constraint Satisfaction.
AMAI 2004 |
| 2 | | Kalev Kask,
Rina Dechter,
Vibhav Gogate:
Counting-Based Look-Ahead Schemes for Constraint Satisfaction.
CP 2004: 317-331 |
| 1 | | Vibhav Gogate,
Rina Dechter:
A Complete Anytime Algorithm for Treewidth.
UAI 2004: 201-208 |
