2796 search results - page 446 / 560 » The coolest path problem |
174
click to vote
TON
2010
15 years 4 months ago
2010
—In this paper, we investigate the maximization of the coverage time for a clustered wireless sensor network (WSN) by optimal balancing of power consumption among cluster heads (...
158
click to vote
TON
2010
15 years 4 months ago
2010
Abstract—Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distrib...
175
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
167
click to vote
SIGMETRICS
2011
ACM
14 years 9 months ago
2011
ACM
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
161
click to vote
ICC
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...