Sciweavers

2714 search results - page 188 / 543
» Approximation Schemes for Scheduling
Sort
View
ICPADS
2006
IEEE
15 years 10 months ago
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson
QEST
2006
IEEE
15 years 9 months ago
Modeling and Optimization Problems in Contact Centers
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
Pierre L'Ecuyer
TPDS
2008
68views more  TPDS 2008»
15 years 3 months ago
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
Teofilo F. Gonzalez
280
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
VTC
2008
IEEE
157views Communications» more  VTC 2008»
15 years 10 months ago
Performance of MIMO Aware RRM in Downlink OFDMA
— This paper addresses advanced radio resource management (RRM) algorithms for multiple-input multipleoutput (MIMO) transmission schemes in downlink OFDMA systems. The analysis c...
István Z. Kovács, Markku Kuusela, El...