704 search results - page 75 / 141 » Novel Algorithms for the Network Lifetime Problem in Wireles... |
JCO
2010
13 years 7 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
ISCC
2007
IEEE
14 years 3 months ago
2007
IEEE
It is beyond any doubt that the unpredictable nature of the today’s Internet has tremendous impact on the transmission of video streams. With respect to the realtime nature of v...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— We consider the novel problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the tradeoff between...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...