21324 search results - page 3786 / 4265 » Making the case for computing |
149
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
143
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
149
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
181
click to vote
WMASH
2003
ACM
15 years 10 months ago
2003
ACM
In the near future, wide variety of wireless networks will be merged into the Internet and allow users to continue their application with higher degree of mobility. In such enviro...
170
Voted
WSNA
2003
ACM
15 years 10 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...