187 search results - page 10 / 38 » Computing Special Values of Partial Zeta Functions |
141
click to vote
CCA
2009
Springer
15 years 2 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
JMLR
2006
14 years 9 months ago
2006
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
AI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
107
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
JUCS
2010
14 years 4 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...