2149 search results - page 349 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
112
click to vote
ATAL
2011
Springer
14 years 1 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
140
click to vote
PODS
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
110
click to vote
PERCOM
2003
ACM
16 years 1 months ago
2003
ACM
Time information is critical for a variety of applications in distributed environments that facilitate pervasive computing and communication. This work describes and evaluates a no...
115
click to vote
MOBIHOC
2006
ACM
16 years 1 months ago
2006
ACM
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
118
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...