6251 search results - page 1171 / 1251 » Randomness, Computability, and Density |
SPAA
2003
ACM
14 years 3 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...
SPAA
2003
ACM
14 years 3 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...
WSNA
2003
ACM
14 years 3 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...
PLDI
2010
ACM
14 years 3 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...