Algorithms for imprecise probabilities
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 956599
- An algebraic treatment of imprecise probabilities
- scientific article; zbMATH DE number 168445
- Improved algorithms via approximations of probability distributions
- Algorithmic Probability: Theory and Applications
- scientific article; zbMATH DE number 4137536
- scientific article; zbMATH DE number 4049028
- scientific article; zbMATH DE number 4047070
- scientific article; zbMATH DE number 1246226
- scientific article; zbMATH DE number 3870594
Cited in
(17)- Geometric foundations for interval-based probabilities
- Using probability trees to compute marginals with imprecise probabilities
- Computing posterior upper expectations
- Thirty years of credal networks: specification, algorithms and complexity
- Probabilistic abduction without priors
- Extreme points of the credal sets generated by comparative probabilities
- Graphical models for imprecise probabilities
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- From imprecise to granular probabilities
- Distribution of expected utility in decision trees
- scientific article; zbMATH DE number 1844477 (Why is no real title available?)
- A propositional CONEstrip algorithm
- Algorithms and Applications for the Same-Decision Probability
- Constructing imprecise probability distributions
- Equivalence of methods for uncertainty propagation of real-valued random variables
- Computing lower and upper expectations under epistemic independence
- Degree of imprecision: geometric and algorithmic approaches
This page was built for publication: Algorithms for imprecise probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2752130)
