Computing probability intervals with simulated annealing and probability trees
From MaRDI portal
Publication:4453899
Recommendations
Cites work
- scientific article; zbMATH DE number 1553119 (Why is no real title available?)
- Exploiting case-based independence for approximating marginal probabilities
- Importance sampling in Bayesian networks using probability trees.
- Interval probability propagation
- Optimization by simulated annealing
- PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
- Removing partial inconsistency in valuation-based systems
- Representing and solving decision problems with limited information
- Strong conditional independence for credal sets
- Using probability trees to compute marginals with imprecise probabilities
Cited in
(4)- Sequential Gaussian simulation vs. simulated annealing for locating pockets of high-value commercial trees in Pennsylvania
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- Using probability trees to compute marginals with imprecise probabilities
- scientific article; zbMATH DE number 1844477 (Why is no real title available?)
This page was built for publication: Computing probability intervals 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 Q4453899)