Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
From MaRDI portal
(Redirected from Publication:1809340)
Cites work
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 3978443 (Why is no real title available?)
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 4189243 (Why is no real title available?)
- A randomized approximation algorithm for probabilistic inference on bayesian belief networks
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Current research directions in the development of expert systems based on belief networks
- Decision Analytic Networks in Artificial Intelligence
- Evidential reasoning using stochastic simulation of causal models
- Fusion and propagation with multiple observations in belief networks
- Fusion, propagation, and structuring in belief networks
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(3)
This page was built for publication: Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809340)