766 search results - page 44 / 154 » Online Variance Minimization |
113
click to vote
ICS
2005
Tsinghua U.
15 years 5 months ago
2005
Tsinghua U.
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...
AMAI
2008
Springer
14 years 12 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
101
click to vote
DEDS
2008
14 years 12 months ago
2008
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
116
click to vote
WAOA
2010
Springer
14 years 9 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
ICML
2007
IEEE
16 years 19 days ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...