Sciweavers

16430 search results - page 571 / 3286
» On Computable Tree Functions
Sort
View
WCE
2007
15 years 8 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—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...
A. N. Baushev, E. Y. Morozova
AML
2008
66views more  AML 2008»
15 years 7 months ago
Algorithmic randomness of continuous functions
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
George Barmpalias, Paul Brodhead, Douglas A. Cenze...
JAIR
2008
126views more  JAIR 2008»
15 years 7 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...
ITA
2007
15 years 7 months ago
Correct rounding of algebraic functions
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...
Nicolas Brisebarre, Jean-Michel Muller
ENTCS
2002
76views more  ENTCS 2002»
15 years 6 months ago
Feasible functionals and intersection of ramified types
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...
Daniel Leivant