2714 search results - page 246 / 543 » Approximation Schemes for Scheduling |
122
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We study the conditional sojourn time distributions of processor sharing (PS), foreground background processor sharing (FBPS) and shortest remaining processing time first (SRPT) s...
171
click to vote
SIGCOMM
2012
ACM
13 years 7 months ago
2012
ACM
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
188
click to vote
WIOPT
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
149
click to vote
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
In this paper, we combine two approaches to handling uncertainty: we use techniques for finding optimal solutions in the expected sense to solve combinatorial optimization proble...
154
click to vote
GLOBECOM
2009
IEEE
15 years 8 months ago
2009
IEEE
We investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical servers. This model has been widely used in studies of em...