641 search results - page 46 / 129 » On robust online scheduling algorithms |
151
click to vote
ICCD
2006
IEEE
16 years 1 months ago
2006
IEEE
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
134
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
On-line boosting is a recent advancement in the field of machine learning that has opened a new spectrum of possibilities in many diverse fields. With respect to a static strong...
120
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
125
click to vote
SIGCOMM
2004
ACM
15 years 10 months ago
2004
ACM
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
146
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...