11910 search results - page 305 / 2382 » Online Learning Algorithms |
173
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
147
click to vote
IWPEC
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
170
click to vote
IROS
2007
IEEE
16 years 28 days ago
2007
IEEE
— In this paper, we present an approach that applies the reinforcement learning principle to the problem of learning height control policies for aerial blimps. In contrast to pre...
146
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
177
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...