554 search results - page 35 / 111 » Approximability of OFDMA Scheduling |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a lengt...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
81
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
ACTA
1998
14 years 9 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...