1033 search results - page 31 / 207 » Redistribution in distributed Ada |
134
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
162
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
141
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
127
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We model social choice problems in which self interested agents with private utility functions have to agree on values for a set of variables subject to side constraints. The goal...
EUROSYS
2009
ACM
16 years 27 days ago
2009
ACM
Emulab is a testbed for networked and distributed systems experimentation. Two guiding principles of its design are realism and control of experimentation. There is an inherent te...