Sciweavers

4066 search results - page 81 / 814
» Almost Complete Sets
Sort
View
SPAA
2005
ACM
14 years 3 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
DAC
2005
ACM
14 years 11 months ago
Energy optimal speed control of devices with discrete speed sets
We obtain analytically, the energy optimal speed profile of a generic multi-speed device with a discrete set of speeds, to execute a given task within a given time. Current implem...
Ravishankar Rao, Sarma B. K. Vrudhula
ICS
2009
Tsinghua U.
14 years 2 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
CCR
2006
82views more  CCR 2006»
13 years 10 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown
ANOR
2008
96views more  ANOR 2008»
13 years 10 months ago
How good are SPT schedules for fair optimality criteria
Abstract We consider the following scheduling setting: a set of
Eric Angel, Evripidis Bampis, Fanny Pascual