702 search results - page 83 / 141 » Algorithms for Minimizing Response Time in Broadcast Schedul... |
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
IPCO
1998
14 years 11 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
SIGMETRICS
2010
ACM
15 years 1 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...
IPCCC
2007
IEEE
15 years 4 months ago
2007
IEEE
Existing packets scheduling algorithms designed for energy-efficient wireless networks ignore important features of periodic packets, thereby being inadequate for periodic packets...