Author of the publication

The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks.

, , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 356-367. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Stable Independence in Perfect Maps, and . CoRR, (2012)Upgrading Ambiguous Signs in QPNs, , and . CoRR, (2012)From Qualitative to Quantitative Probabilistic Networks, and . CoRR, (2013)Balanced Tuning of Multi-dimensional Bayesian Network Classifiers., and . ECSQARU, volume 9161 of Lecture Notes in Computer Science, page 210-220. Springer, (2015)When Learning Naive Bayesian Classifiers Preserves Monotonicity., , and . ECSQARU, volume 6717 of Lecture Notes in Computer Science, page 422-433. Springer, (2011)A conceptual model for inexact reasoning in rule-based systems.. Int. J. Approx. Reason., 3 (3): 239-258 (1989)Probabilities for a probabilistic network: a case study in oesophageal cancer., , , , and . Artif. Intell. Medicine, 25 (2): 123-148 (2002)Context-specific sign-propagation in qualitative probabilistic networks., , and . Artif. Intell., 140 (1/2): 207-230 (2002)The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks., , and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 356-367. Springer, (2011)Supporting Probability Elicitation by Sensitivity Analysis., and . EKAW, volume 1319 of Lecture Notes in Computer Science, page 335-340. Springer, (1997)