<--- Back to Details
First PageDocument Content
Numerical analysis / Statistical methods / Monte Carlo method / Probabilistic complexity theory / Sensitivity analysis / Mathematical model / Economic model / Probability distribution / Regression analysis / Mathematics / Statistics / Science
Numerical analysis
Statistical methods
Monte Carlo method
Probabilistic complexity theory
Sensitivity analysis
Mathematical model
Economic model
Probability distribution
Regression analysis
Mathematics
Statistics
Science

Uncertainty in Design Space

Add to Reading List

Source URL: www.fda.gov

Download Document from Source Website

File Size: 986,31 KB

Share Document on Facebook

Similar Documents

Probability / Probabilistic complexity theory / Probability theory / PRISM model checker / Software / Sample space / Model checking / Stochastic process / Randomized algorithm

Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014

DocID: 1rrqu - View Document

Theoretical computer science / Lance Fortnow / Probabilistic complexity theory / Carsten Lund / Computer science / IP / BPP / Probabilistically checkable proof / Symposium on Foundations of Computer Science / Mathematics

Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.

DocID: 1rgOi - View Document

Computational complexity theory / Complexity classes / IP / Proof of knowledge / NP / Soundness / Interactive proof system / PSPACE / Zero-knowledge proof / Probabilistic complexity theory / Mathematical proof / Quadratic residue

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rgbF - View Document

Markov models / Probability theory / Statistics / Probability / Probabilistic complexity theory / Markov processes / Statistical models / Graph theory / Markov chain / Randomized algorithm / Stochastic process / Algorithm

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By

DocID: 1rdMz - View Document

Cryptography / Polynomials / Probabilistic complexity theory / IP / Commitment scheme / NP / Interactive proof system / Zero-knowledge proof / Polynomial interpolation / Polynomial / Random self-reducibility / Permutation polynomial

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

DocID: 1raDV - View Document