Sciweavers

2714 search results - page 71 / 543
» Approximation Schemes for Scheduling
Sort
View
95
Voted
QSHINE
2009
IEEE
15 years 7 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
RTS
2011
131views more  RTS 2011»
14 years 7 months ago
Global scheduling based reliability-aware power management for multiprocessor real-time systems
Reliability-aware power management (RAPM) has been a recent research focus due the negative effects of the popular power management technique dynamic voltage and frequency scaling ...
Xuan Qi, Dakai Zhu, Hakan Aydin
98
Voted
ALGORITHMICA
2010
104views more  ALGORITHMICA 2010»
15 years 20 days ago
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work...
Liming Cai, Xiuzhen Huang
104
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
15 years 4 months ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith