Sciweavers

657 search results - page 13 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
INFOCOM
2006
IEEE
15 years 5 months ago
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks
— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
Michael J. Neely
104
Voted
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 6 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
OPODIS
2008
15 years 1 months ago
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms
Abstract Nowadays, most of the energy-aware real-time scheduling algorithms belong to the DVFS (Dynamic Voltage and Frequency Scaling) framework. These DVFS algorithms are usually ...
Joël Goossens, Dragomir Milojevic, Vincent N&...
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 1 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
DAM
2008
108views more  DAM 2008»
14 years 11 months ago
Feedback vertex set on AT-free graphs
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
Dieter Kratsch, Haiko Müller, Ioan Todinca