780 search results - page 140 / 156 » Robustness and Randomness |
129
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
147
Voted
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
133
Voted
SPAA
2003
ACM
15 years 9 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...
117
Voted
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
111
Voted
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...