1629 search results - page 41 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Providing energy-efficient continuous data collection services is of paramount importance to Wireless Sensor Network (WSN) applications. This paper proposes a new power manageme...
CSC
2008
14 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
SODA
2012
ACM
13 years 6 days ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
TSP
2010
14 years 4 months ago
2010
We study state estimation via wireless sensors over fading channels. Packet loss probabilities depend upon time-varying channel gains, packet lengths and transmission power levels ...
ICCAD
2009
IEEE
14 years 7 months ago
2009
IEEE
Decoupling capacitance (decap) is an efficient way to reduce transient noise in on-chip power supply networks. However, excessive decap may cause more leakage power, chip resource...