 | 2011 |
|---|
| 12 |       | Johan Kwisthout,
Hans L. Bodlaender,
Linda C. van der Gaag:
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks.
SOFSEM 2011: 356-367 |
| 11 | | Johan Kwisthout,
Todd Wareham,
Iris van Rooij:
Bayesian Intractability Is Not an Ailment That Approximation Can Cure.
Cognitive Science 35(5): 779-784 (2011) |
| 10 | | Johan Kwisthout:
Most probable explanations in Bayesian networks: Complexity and tractability.
Int. J. Approx. Reasoning 52(9): 1452-1469 (2011) |
| 2010 |
|---|
| 9 | | Johan Kwisthout,
Hans L. Bodlaender,
Linda C. van der Gaag:
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks.
ECAI 2010: 237-242 |
| 2008 |
|---|
| 8 | | Johan Kwisthout,
Linda C. van der Gaag:
The Computational Complexity of Sensitivity Analysis and Parameter Tuning.
UAI 2008: 349-356 |
| 7 | | Johan Kwisthout,
Paul Vogt,
Pim Haselager,
Ton Dijkstra:
Joint attention and language evolution.
Connect. Sci. 20(2&3): 155-171 (2008) |
| 6 | | Johan Kwisthout,
Gerard Tel:
Complexity results for enhanced qualitative probabilistic networks.
Int. J. Approx. Reasoning 48(3): 879-888 (2008) |
| 2007 |
|---|
| 5 | | Johan Kwisthout,
Hans L. Bodlaender,
Gerard Tel:
Local Monotonicity in Probabilistic Networks.
ECSQARU 2007: 548-559 |
| 4 | | Johan Kwisthout:
The Computational Complexity of Monotonicity in Probabilistic Networks.
FCT 2007: 388-399 |
| 2006 |
|---|
| 3 | | Johan Kwisthout,
Gerard Tel:
Complexity Results for Enhanced Qualitative Probabilistic Networks.
Probabilistic Graphical Models 2006: 171-178 |
| 2005 |
|---|
| 2 |  | Johan Kwisthout,
Mehdi Dastani:
Modelling Uncertainty in Agent Programming.
BNAIC 2005: 361-362 |
| 1 | | Johan Kwisthout,
Mehdi Dastani:
Modelling Uncertainty in Agent Programming.
DALT 2005: 17-32 |
Data released under the ODC-BY 1.0 license — See also our legal information page