554 search results - page 11 / 111 » Approximability of OFDMA Scheduling |
TON
2010
14 years 4 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
FSTTCS
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
90
Voted
FCS
2008
14 years 11 months ago
2008
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
MOR
2000
14 years 9 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...