The computational complexity of problems to compute intervals wrappers for random variables uniform, Exponential and Pareto

When working with floating point numbers the result is only an approximation of a real value and errors generated by rounding or by instability of the algorithms can lead to incorrect results. We can't affirm the accuracy of the estimated answer without the contribution of an error analysis. In...

Celý popis

Podrobná bibliografia

Vydané v:	2012 XXXVIII Conferencia Latinoamericana en Informatica s. 1 - 9
Hlavní autori:	Finger, A. F., Loreto, A. B., Campos, M. A., Varjao, F. R. G., dos Santos, M. D.
Médium:	Konferenčný príspevok..
Jazyk:	English Portuguese
Vydavateľské údaje:	IEEE 01.10.2012
Predmet:	Algorithm design and analysis Approximation algorithms Approximation methods Computational complexity Electronic mail Interval arithmetic Numerical Algorithms and Problems Random variables Security Statistical computing
ISBN:	9781467307949, 1467307947
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!