6105 search results - page 891 / 1221 » A Parallel Algorithm for Bound-Smoothing |
181
click to vote
PDCAT
2005
Springer
16 years 6 days ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
201
click to vote
PPSN
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We review and investigate the current status of intransitivity as a potential obstacle in coevolution. Pareto-Coevolution avoids intransitivity by translating any standar...
157
click to vote
HPDC
2003
IEEE
16 years 2 hour ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
153
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
174
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...