569 search results - page 65 / 114 » Online Bounds for Bayesian Algorithms |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
119
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
APPROX
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...