Sciweavers

7930 search results - page 1486 / 1586
» Greedy in Approximation Algorithms
Sort
View
COMPGEOM
2009
ACM
15 years 10 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
135
Voted
ISLPED
2009
ACM
178views Hardware» more  ISLPED 2009»
15 years 10 months ago
Power management in energy harvesting embedded systems with discrete service levels
Power management has been a critical issue in the design of embedded systems due to the limited power supply. To prolong the lifetime, energy minimization has been studied under p...
Clemens Moser, Jian-Jia Chen, Lothar Thiele
CISS
2008
IEEE
15 years 10 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
148
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
138
Voted
SRDS
2008
IEEE
15 years 10 months ago
Probabilistic Failure Detection for Efficient Distributed Storage Maintenance
Distributed storage systems often use data replication to mask failures and guarantee high data availability. Node failures can be transient or permanent. While the system must ge...
Jing Tian, Zhi Yang, Wei Chen, Ben Y. Zhao, Yafei ...
« Prev « First page 1486 / 1586 Last » Next »