Sciweavers

657 search results - page 4 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
92
Voted
ECRTS
2004
IEEE
15 years 1 months ago
On Energy-Constrained Real-Time Scheduling
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...
Tarek A. AlEnawy, Hakan Aydin
MONET
2006
103views more  MONET 2006»
14 years 9 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
INFOCOM
2005
IEEE
15 years 3 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...
DATE
2009
IEEE
133views Hardware» more  DATE 2009»
15 years 4 months ago
Energy efficient multiprocessor task scheduling under input-dependent variation
— In this paper, we propose a novel, energy aware scheduling algorithm for applications running on DVS-enabled multiprocessor systems, which exploits variation in execution times...
Jason Cong, Karthik Gururaj
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
14 years 10 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura