Sciweavers

2714 search results - page 145 / 543
» Approximation Schemes for Scheduling
Sort
View
105
Voted
MOBIHOC
2006
ACM
15 years 6 months ago
Wakeup scheduling in wireless sensor networks
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
Abtin Keshavarzian, Huang Lee, Lakshmi Venkatraman
100
Voted
GLVLSI
2005
IEEE
132views VLSI» more  GLVLSI 2005»
15 years 6 months ago
FPGA implementation of a modular and pipelined WF scheduler for high speed OC192 networks
In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algorithm able to handle variable length packets targeted for Packet Over Sonet (POS...
Abdallah Merhebi, Otmane Aït Mohamed
ICC
2007
IEEE
127views Communications» more  ICC 2007»
15 years 4 months ago
Spectral Efficiency of Channel-Aware Schedulers in Non-Identical Composite Links with Interference
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...
Jingxian Wu, Neelesh B. Mehta, Andreas F. Molisch,...
ICALP
2004
Springer
15 years 6 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
106
Voted
ICALP
2009
Springer
16 years 1 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson