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...

Full description

Bibliographic Details

Published in:	2012 XXXVIII Conferencia Latinoamericana en Informatica pp. 1 - 9
Main Authors:	Finger, A. F., Loreto, A. B., Campos, M. A., Varjao, F. R. G., dos Santos, M. D.
Format:	Conference Proceeding
Language:	English Portuguese
Published:	IEEE 01.10.2012
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!