Evaluation of Bayesian networks with flexible state-space abstraction methods
From MaRDI portal
Publication:1603306
DOI10.1016/S0888-613X(01)00067-6zbMath1006.68130OpenAlexW2136801834WikidataQ56454249 ScholiaQ56454249MaRDI QIDQ1603306
Chao-Lin Liu, Michael P. Wellman
Publication date: 11 July 2002
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0888-613x(01)00067-6
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Cites Work
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Probabilistic inference in multiply connected belief networks using loop cutsets
- Evidential reasoning using stochastic simulation of causal models
- Approximating MAPs for belief networks is NP-hard and other theorems
- Deliberation scheduling for problem solving in time-constrained environments
- Finding MAPs for belief networks is NP-hard
- An optimal approximation algorithm for Bayesian inference
- The computational complexity of probabilistic inference using Bayesian belief networks
- On the hardness of approximate reasoning
- Local conditioning in Bayesian networks
- Probabilistic Inference and Influence Diagrams
- On linear potential functions for approximating Bayesian computations
- An algebra of bayesian belief universes for knowledge‐based systems
- On Information and Sufficiency
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item