Sciweavers

2212 search results - page 136 / 443
» Weighted control scheduling
Sort
View
ISCC
2003
IEEE
152views Communications» more  ISCC 2003»
14 years 3 months ago
Dynamic Fair Queuing (DFQ): A Novel Fair Scheduler Improving Wireless Transmission over Hybrid LANs
Local area network (LAN) will be a hybrid network that includes wired and wireless links together. Nonetheless, the wired hosts always take the most bandwidth and bring about the ...
Ce-Kuen Shieh, Yu-Ben Miao, Ming-Qi Shieh, Wen-Shy...
MASCOTS
2007
13 years 11 months ago
Multiobjective Analysis in Wireless Mesh Networks
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
Cristiana Gomes, Gurvan Huiban
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 11 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 8 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...
RTSS
1994
IEEE
14 years 2 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo