242 search results - page 42 / 49 » Distributed algorithms with dynamical random transitions |
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
108
click to vote
IMC
2006
ACM
15 years 5 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
IPSN
2004
Springer
15 years 5 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
103
click to vote
OSDI
2002
ACM
15 years 12 months ago
2002
ACM
Pangaea is a wide-area file system that supports data sharing among a community of widely distributed users. It is built on a symmetrically decentralized infrastructure that consi...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a two-sided economic search model in which agents are searching for beneficial pairwise partnerships. In each search stage, each of the agents is randomly mat...