Sciweavers

2323 search results - page 111 / 465
» Power optimization for connectivity problems
Sort
View
148
Voted
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
15 years 3 months ago
A General Approximation Technique for Constrained Forest Problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
Michel X. Goemans, David P. Williamson
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
15 years 2 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
167
Voted
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 9 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
117
Voted
RTSS
2006
IEEE
15 years 8 months ago
System-Level Energy Management for Periodic Real-Time Tasks
In this paper, we consider the system-wide energy management problem for a set of periodic real-time tasks running on a DVS-enabled processor. Our solution uses a generalized powe...
Hakan Aydin, Vinay Devadas, Dakai Zhu
136
Voted
GLOBECOM
2008
IEEE
15 years 9 months ago
Near-Optimum Power Allocation for Outage Restricted Distributed MIMO Multi-Hop Networks
Abstract—The throughput of multi-hop communication systems can significantly be increased by the application of MIMO concepts. To utilize the physical resources in an efficient...
Dirk Wübben, Yidong Lang