407 search results - page 16 / 82 » The Optimal Online Algorithms for Minimizing Maximum Latenes... |
71
Voted
COLT
2004
Springer
15 years 2 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
COR
2011
14 years 4 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
TSMC
2008
14 years 9 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
104
click to vote
SCHEDULING
2008
14 years 9 months ago
2008
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
As storage systems scale to thousands of disks, data distribution and load balancing become increasingly important. We present an algorithm for allocating data objects to disks as...