Computing intervals of probabilities with simulated annealing and probability trees

DOI10.1007/3-540-44652-4_25MaRDI QIDQ4784843zbMATH OpenFDO

Authors Andrés Cano, Serafin Moral

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2143/21430278

Mathematics Subject Classification ID

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

Recommendations

• Computing probability intervals with simulated annealing and probability trees
• Using probability trees to compute marginals with imprecise probabilities
• Interval probability propagation
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Algorithms for imprecise probabilities

Cited in

(5)

• Interval probability propagation
• Using probability trees to compute marginals with imprecise probabilities
• Sequential Gaussian simulation vs. simulated annealing for locating pockets of high-value commercial trees in Pennsylvania
• Computing probability intervals with simulated annealing and probability trees
• Partial abductive inference in Bayesian belief networks by simulated annealing

This page was built for publication: Computing intervals of probabilities with simulated annealing and probability trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4784843)