The search algorithm presented allows the CDF of a dependent variable to be bounded with 100% confidence, and allows for a guaranteed evaluation of the error involved. These reliability bounds are often enough to make decisions, and often require a minimal number of function evaluations. The procedure is not intrusive, i.e. it can be equally applied when the function is a complex computer model (black box). The proposed procedure can handle input information consisting of probabilistic, interval-valued, set-valued, or random-set-valued information, as well as any combination thereof. The function as well as the joint pdf of the input variables can be of any type.
Reliable Computing – Springer Journals
Published: Dec 20, 2006
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud