5592 search results - page 1018 / 1119 » On Random Betweenness Constraints |
185
Voted
FSTTCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
143
Voted
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
Complex Network of Earthquakes Sumiyoshi Abe Institute of Physics, University of Tsukuba Ibaraki 3058571, Japan First, a brief discussion is made about a relevance of nonextensive...
147
Voted
ICSNW
2004
Springer
15 years 10 months ago
2004
Springer
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
120
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
148
Voted
IWQOS
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...