Methods for constructing balanced elimination trees and other recursive decompositions
type: Item
instance of: scholarly article
title: Methods for constructing balanced elimination trees and other recursive decompositions
zbMATH Open document ID: 1191.68677
author: Kevin Grant
author: Michael C. Horsch
published in: International Journal of Approximate Reasoning
publication date: 2010-04-07T00:00:00Z
Mathematics Subject Classification ID: 68T37
zbMATH DE Number: 5690208
zbMATH Keywords: Bayesian networks
zbMATH Keywords: recursive factorizations
zbMATH Keywords: compilation of graphical models
MaRDI profile type: Publication
full work available at URL: j.ijar.2009.04.010
OpenAlex ID: W1967824220
cites work: Q4734791
cites work: Bucket elimination: A unifying framework for reasoning
cites work: Q4386963
cites work: Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
cites work: Recursive conditioning
cites work: Anytime anyspace probabilistic inference
cites work: AI 2005: Advances in Artificial Intelligence
cites work: Q4784837
cites work: Inference in belief networks: A procedural guide
DOI: 10.1016/J.IJAR.2009.04.010
description: scientific article; zbMATH DE number 5690208