11910 search results - page 288 / 2382 » Online Learning Algorithms |
147
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
158
click to vote
ICRA
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper proposes a statistical method for calibrating the odometry of mobile robots. In contrast to previous approaches, which require explicit measurements of actual motion wh...
166
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
184
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
180
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
A number of reinforcement learning algorithms have been developed that are guaranteed to converge to the optimal solution when used with lookup tables. It is shown, however, that ...