2001
DOI: 10.1007/978-1-4615-0013-1_17
|View full text |Cite
|
Sign up to set email alerts
|

Error Estimations for Indirect Measurements: Randomized vs. Deterministic Algorithms for “Black-Box” Programs

Abstract: In many real-life situations, it is very difficult or even impossible to directly measure the quantity in which we are interested: e.g., we cannot directly measure a distance to a distant galaxy or the amount of oil in a given well. Since we cannot measure such quantities directly, we can measure them indirectly: by first measuring some relating quantities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2004
2004
2012
2012

Publication Types

Select...
5
2
1

Relationship

4
4

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…Important observations and explanations about the methods are discussed in detail in Section 4.3. The seminal paper on CD is Kreinovich and Trejo (2001). More details can be found in Kreinovich and Ferson (2004) and Kreinovich et al (2007).…”
Section: Worst-case Searchmentioning
confidence: 99%
See 1 more Smart Citation
“…Important observations and explanations about the methods are discussed in detail in Section 4.3. The seminal paper on CD is Kreinovich and Trejo (2001). More details can be found in Kreinovich and Ferson (2004) and Kreinovich et al (2007).…”
Section: Worst-case Searchmentioning
confidence: 99%
“…In the second step, we need to solve an optimisation problem subject to polyhedral constraints to actually find the worst-case scenario. We propose a solution approach that is computationally very attractive and can be easily parallelised, inspired by the simulationbased Cauchy deviates method for interval uncertainty (see Kreinovich and Trejo, 2001; Kreinovich and Ferson, 2004;Kreinovich et al, 2007).…”
Section: Introductionmentioning
confidence: 99%
“…In this section we present an approach inspired by the Cauchy deviates method (CD) for interval uncertainty [14,13,12], i.e.,…”
Section: Worst-case Searchmentioning
confidence: 99%
“…In the second step, to actually find the worst-case scenario, we need to solve an optimization problem subject to polyhedral constraints. For very high-dimensional problems we propose a solution approach that is computationally very attractive and can be easily parallelized, inspired by the simulation based Cauchy deviates method for interval uncertainty [14,13,12].…”
Section: Introductionmentioning
confidence: 99%
“…[49]: Finding an upper bound on the variance is NP-hard, a lower bound can be found in quadratic time. The field of applications of interval uncertainty for uncertainty handling is vast, e.g., [23], [53], [67], [68], [79].…”
Section: Safety Marginsmentioning
confidence: 99%