554 search results - page 45 / 111 » Approximability of OFDMA Scheduling |
DSN
2008
IEEE
15 years 4 months ago
2008
IEEE
Temporal locality in workloads creates conditions in which a server, in order to remain available, should quickly process bursts of requests with large service requirements. In th...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimu...
107
click to vote
LATIN
2010
Springer
14 years 11 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
IPCO
2007
14 years 11 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...