3082 search results - page 250 / 617 » New Bounds for the Controller Problem |
179
click to vote
TRANSCI
2008
15 years 5 months ago
2008
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
221
click to vote
JMLR
2012
13 years 9 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
203
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
168
click to vote
STACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
147
click to vote
UAI
2004
15 years 8 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...