Sciweavers

2840 search results - page 472 / 568
» Distributed cooperative caching
Sort
View
ESAW
2000
Springer
14 years 1 months ago
Models of Coordination
While software is becoming decomposed in more and more finegrained entities, the interactions amongst those become of major importance. While methodologies for building such compon...
Robert Tolksdorf
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
13 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
ATAL
2010
Springer
13 years 11 months ago
Using graph analysis to study networks of adaptive agent
Experimental analysis of networks of cooperative learning agents (to verify certain properties such as the system's stability) has been commonly used due to the complexity of...
Sherief Abdallah
EJC
2007
13 years 10 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
TPDS
2010
117views more  TPDS 2010»
13 years 4 months ago
Reputation-Based Resource Allocation in P2P Systems of Rational Users
In this paper, we study p2p systems, where peers have to share their available resources between their own and other peers' needs. One such example is a system of peers who us...
Anna Satsiou, Leandros Tassiulas