759 search results - page 140 / 152 » Creating social networks to improve peer-to-peer networking |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
OSDI
2002
ACM
14 years 7 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Recent studies on mobility modeling have focused on characterizing user mobility from real traces of wireless LANs (WLANs) and creating mobility models based on such characterizat...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Multi-Agent Reinforcement Learning (MARL) algorithms suffer from slow convergence and even divergence, especially in largescale systems. In this work, we develop an organization-b...
WIMOB
2008
IEEE
14 years 1 months ago
2008
IEEE
—In the past few years there has been increasing research interest in service discovery protocols for Mobile Ad Hoc Networks (MANET). The most promising approaches so far address...