Sciweavers

657 search results - page 90 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
MOBIHOC
2003
ACM
16 years 3 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
ICCAD
2006
IEEE
189views Hardware» more  ICCAD 2006»
16 years 23 days ago
Allocation cost minimization for periodic hard real-time tasks in energy-constrained DVS systems
Energy-efficiency and power-awareness for electronic systems have been important design issues in hardware and software implementations. We consider the scheduling of periodic ha...
Jian-Jia Chen, Tei-Wei Kuo
150
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra
140
Voted
ICALP
2001
Springer
15 years 8 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 3 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller