212 search results - page 21 / 43 » Competitive Online Approximation of the Optimal Search Ratio |
NIPS
2007
13 years 9 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
LION
2007
Springer
14 years 1 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
IPPS
2000
IEEE
14 years 1 days ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
RANDOM
1999
Springer
13 years 12 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...