Sciweavers

7133 search results - page 53 / 1427
» Communication algorithms with advice
Sort
View
INFOCOM
2012
IEEE
11 years 11 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
CISS
2008
IEEE
14 years 3 months ago
Optimization via communication networks
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
Matthew Andrews
INFOCOM
2012
IEEE
11 years 11 months ago
A simpler and better design of error estimating coding
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
Nan Hua, Ashwin Lall, Baochun Li, Jun Xu
HICSS
1994
IEEE
95views Biometrics» more  HICSS 1994»
14 years 28 days ago
On-Line Detection and Resolution of Communication Deadlocks
We present a new distributed algorithm that detects and resolves communication deadlocks on-line, i.e., simultaneously detects and resolves deadlock as communication requests are ...
Wee Keong Ng, Chinya V. Ravishankar
CCGRID
2008
IEEE
14 years 3 months ago
Joint Communication and Computation Task Scheduling in Grids
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
Kostas Christodoulopoulos, Nikolaos D. Doulamis, E...