206 search results - page 33 / 42 » Better Bounds for Online Scheduling |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
RTAS
2003
IEEE
14 years 25 days ago
2003
IEEE
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies,...
JSS
2007
13 years 7 months ago
2007
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies...
ESTIMEDIA
2007
Springer
14 years 1 months ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...