554 search results - page 57 / 111 » Approximability of OFDMA Scheduling |
102
click to vote
MP
2007
14 years 9 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
IPSN
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
AOR
2007
14 years 10 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
114
click to vote
WCNC
2008
IEEE
15 years 4 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...