Sciweavers

657 search results - page 105 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
INFOCOM
2008
IEEE
15 years 6 months ago
Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...
Gianluca Rizzo, Jean-Yves Le Boudec
INFOCOM
2005
IEEE
15 years 5 months ago
Optimal utility based multi-user throughput allocation subject to throughput constraints
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
Matthew Andrews, Lijun Qian, Alexander L. Stolyar
EMSOFT
2009
Springer
15 years 3 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
INFOCOM
2006
IEEE
15 years 5 months ago
Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions
— We address the problem of energy efficient sensing by adaptively coordinating the sleep schedules of sensor nodes while guaranteeing that values of sleeping nodes can be recov...
Farinaz Koushanfar, Nina Taft, Miodrag Potkonjak
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 1 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking