Bounded recursive decomposition: A search-based method for belief-network inference under limited resources

DOI10.1016/0888-613X(96)00012-6zbMATH Open0941.68765OpenAlexW2073205103MaRDI QIDQ1809340FDOQ1809340

Authors: Stefano Monti, Gregory F. Cooper 

Publication date: 20 December 1999

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0888-613x(96)00012-6

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Evidential reasoning using stochastic simulation of causal models
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• The computational complexity of probabilistic inference using Bayesian belief networks
• Fusion, propagation, and structuring in belief networks
• Title not available (Why is that?)
• A randomized approximation algorithm for probabilistic inference on bayesian belief networks
• Fusion and propagation with multiple observations in belief networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Current research directions in the development of expert systems based on belief networks
• Decision Analytic Networks in Artificial Intelligence

Cited In (3)

• Methods for constructing balanced elimination trees and other recursive decompositions
• Anytime anyspace probabilistic inference
• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques

Uses Software

• NESTOR

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)