Sciweavers

2110 search results - page 360 / 422
» What is the complexity of a distributed computing system
Sort
View
147
Voted
P2P
2005
IEEE
137views Communications» more  P2P 2005»
15 years 9 months ago
The Essence of P2P: A Reference Architecture for Overlay Networks
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...
CSB
2004
IEEE
112views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Reasoning about Molecular Similarity and Properties
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
Rahul Singh
ICDCN
2009
Springer
15 years 10 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...
P2P
2007
IEEE
113views Communications» more  P2P 2007»
15 years 10 months ago
Handling Network Partitions and Mergers in Structured Overlay Networks
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
161
Voted
ATAL
2010
Springer
15 years 5 months ago
Optimal social laws
Social laws have proved to be a powerful and theoretically elegant framework for coordination in multi-agent systems. Most existing models of social laws assume that a designer is...
Thomas Ågotnes, Michael Wooldridge