A generalization of p-boxes to affine arithmetic
- 4 January 2012
- journal article
- research article
- Published by Springer Science and Business Media LLC in Computing
- Vol. 94 (2-4), 189-201
- https://doi.org/10.1007/s00607-011-0182-8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Static Analysis of Finite Precision ComputationsLecture Notes in Computer Science, 2011
- Approximate interval method for epistemic uncertainty propagation using Polynomial Chaos and evidence theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- A Logical Product Approach to Zonotope IntersectionLecture Notes in Computer Science, 2010
- Equivalence of methods for uncertainty propagation of real-valued random variablesInternational Journal of Approximate Reasoning, 2004
- Constructing Probability Boxes and Dempster-Shafer StructuresPublished by Office of Scientific and Technical Information (OSTI) ,2003
- An Introduction to CopulasPublished by Springer Science and Business Media LLC ,1999
- Bounding the Results of Arithmetic Operations on Random Variables of Unknown Dependency Using IntervalsReliable Computing, 1998
- A stochastic arithmetic for reliable scientific computationMathematics and Computers in Simulation, 1993
- Probabilistic arithmetic. I. Numerical methods for calculating convolutions and dependency boundsInternational Journal of Approximate Reasoning, 1990
- Best-possible bounds for the distribution of a sum — a problem of KolmogorovProbability Theory and Related Fields, 1987