580 search results - page 60 / 116 » Choosing a random peer |
ROBOCOMM
2007
IEEE
15 years 6 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
MM
2004
ACM
15 years 5 months ago
2004
ACM
“15 seconds of fame1 ” is an interactive art installation which elevates the face of a randomly selected gallery visitor for 15 seconds into a “work of art”. The installat...
101
click to vote
ICDCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider a model for decentralized collaborative networks that is based on stable matching theory. This model is applied to systems with a global ranking utility function, whic...
119
click to vote
COMCOM
2011
14 years 6 months ago
2011
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...