13784 search results - page 318 / 2757 » On Computing Functions with Uncertainty |
141
click to vote
AAECC
1995
Springer
15 years 10 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
173
click to vote
WCE
2007
15 years 7 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
163
click to vote
AML
2008
15 years 6 months ago
2008
We investigate notions of randomness in the space C(2N ) of continuous functions on 2N . A probability measure is given and a version of the Martin-L
148
click to vote
ITA
2007
15 years 6 months ago
2007
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
149
click to vote
ENTCS
2002
15 years 6 months ago
2002
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...