120 search results - page 1 / 24 » Tractable Optimal Competitive Scheduling |
96
Voted
AIPS
2006
15 years 2 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
129
click to vote
MST
2008
15 years 1 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
IPL
2008
15 years 1 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
STACS
2004
Springer
15 years 6 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 ...
125
click to vote
ICPADS
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we address the problem of cross-layer optimization in medium access control (MAC) and network layers for wireless multicasting with multiple cooperative or competit...