Computing probability intervals with simulated annealing and probability trees
From MaRDI portal
Publication:4453899
DOI10.3166/JANCL.12.151-171zbMATH Open1060.68117OpenAlexW2071849264MaRDI QIDQ4453899FDOQ4453899
Serafin Moral, Andrés Cano, Juan M. Fernández-Luna
Publication date: 7 March 2004
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.12.151-171
Cites Work
- Optimization by Simulated Annealing
- Importance sampling in Bayesian networks using probability trees.
- Title not available (Why is that?)
- Strong conditional independence for credal sets
- Representing and Solving Decision Problems with Limited Information
- PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
- Using probability trees to compute marginals with imprecise probabilities
- Interval probability propagation
- Exploiting case-based independence for approximating marginal probabilities
- Removing partial inconsistency in valuation-based systems
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
- Title not available (Why is that?)
Recommendations
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)
