Sciweavers

10901 search results - page 118 / 2181
» Approximations in Distributed Optimization
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
16 years 3 months ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha
SPAA
1999
ACM
15 years 10 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
TCAD
2010
107views more  TCAD 2010»
15 years 1 months ago
Evaluating Statistical Power Optimization
In response to the increasing variations in integrated-circuit manufacturing, the current trend is to create designs that take these variations into account statistically. In this ...
Jason Cong, Puneet Gupta, John Lee
FOCM
2010
97views more  FOCM 2010»
15 years 5 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
Levent Tunçel, Arkadi Nemirovski