2714 search results - page 8 / 543 » Approximation Schemes for Scheduling |
PUK
2000
14 years 10 months ago
2000
Progressive processing plans allow systems to tradeoff computational resources against the quality of service by specifying alternative ways in which to accomplish each step. When ...
ISCA
2002
IEEE
15 years 2 months ago
2002
IEEE
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
112
click to vote
MOBICOM
2006
ACM
15 years 3 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
ICMCS
2009
IEEE
14 years 7 months ago
2009
IEEE
Network coding has been recently applied to wireless networks to increase throughput. It is typically implemented as a thin layer between MAC and IP, transparently to higher layer...
FORMATS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...