Author of the publication

Complexity results for enhanced qualitative probabilistic networks.

, and . Int. J. Approx. Reason., 48 (3): 879-888 (2008)

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

The Computational Complexity of Sensitivity Analysis and Parameter Tuning, and . CoRR, (2012)Complexity results for enhanced qualitative probabilistic networks., and . Int. J. Approx. Reason., 48 (3): 879-888 (2008)Motivating explanations in Bayesian networks using MAP-independence.. Int. J. Approx. Reason., (2023)Benchmarking energy consumption and latency for neuromorphic computing in condensed matter and particle physics., , , , , , , , , and 3 other author(s). CoRR, (2022)A Spiking Neuron Implementation of Genetic Algorithms for Optimization., , , , and . BNAIC/BENELEARN (Selected Papers), volume 1398 of Communications in Computer and Information Science, page 91-105. Springer, (2020)The Parameterized Complexity of Approximate Inference in Bayesian Networks.. Probabilistic Graphical Models, volume 52 of JMLR Workshop and Conference Proceedings, page 264-274. JMLR.org, (2016)Predictive coding and the Bayesian brain: Intractability hurdles that are yet to be overcome., and . CogSci, cognitivesciencesociety.org, (2013)Bayesian Intractability Is Not an Ailment That Approximation Can Cure., , and . Cogn. Sci., 35 (5): 779-784 (2011)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)Modelling Uncertainty in Agent Programming., and . DALT, volume 3904 of Lecture Notes in Computer Science, page 17-32. Springer, (2005)