Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
type: Item
instance of: scholarly article
title: Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
zbMATH Open document ID: 0941.68765
DOI: 10.1016/0888-613X(96)00012-6
author: Stefano Monti
author: Gregory F. Cooper
published in: International Journal of Approximate Reasoning
publication date: 1999-12-20T00:00:00Z
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 1380991
describes a project that uses: NESTOR
MaRDI profile type: Publication
cites work: Evidential reasoning using stochastic simulation of causal models
cites work: Current research directions in the development of expert systems based on belief networks
cites work: Decision Analytic Networks in Artificial Intelligence
cites work: Fusion, propagation, and structuring in belief networks
cites work: Q5753588
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Q3201783
cites work: Q4734791
cites work: Fusion and propagation with multiple observations in belief networks
cites work: A randomized approximation algorithm for probabilistic inference on bayesian belief networks
cites work: Q3795276
cites work: Q3742763
full work available at URL: 0888-613x(96)00012-6
OpenAlex ID: W2073205103
description: scientific article; zbMATH DE number 1380991