Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
type: Item
instance of: scholarly article
title: Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
zbMATH Open document ID: 1116.68080
author: N. E. Zubov
published in: International Journal of Approximate Reasoning
publication date: 2007-05-18T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5154704
zbMATH Keywords: credal network
zbMATH Keywords: probability intervals
zbMATH Keywords: Bayesian networks
zbMATH Keywords: strong independence
zbMATH Keywords: hill-climbing
zbMATH Keywords: branch-and-bound algorithms
MaRDI profile type: Publication
Wikidata QID: Q57551191
full work available at URL: j.ijar.2006.07.020
OpenAlex ID: W2016619340
cites work: Computing probability intervals with simulated annealing and probability trees
cites work: Using probability trees to compute marginals with imprecise probabilities
cites work: Q4525198
cites work: Credal networks
cites work: Graphical models for imprecise probabilities
cites work: Q5753553
cites work: Q4408097
cites work: On Information and Sufficiency
cites work: Q4734791
cites work: Strong conditional independence for credal sets
cites work: Interval probability propagation
cites work: Q3999364
DBLP publication ID: journals/ijar/CanoGMA07
DOI: 10.1016/J.IJAR.2006.07.020
description: scientific article; zbMATH DE number 5154704