Sciweavers

276 search results - page 25 / 56
» Proving Properties of Dynamic Process Networks
Sort
View
IJCAI
2003
14 years 11 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
SIGMETRICS
2004
ACM
131views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
Failure recovery for structured P2P networks: protocol design and performance evaluation
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
ICLP
2009
Springer
15 years 10 months ago
A Language for Large Ensembles of Independently Executing Nodes
We address how to write programs for distributed computing systems in which the network topology can change dynamically. Examples of such systems, which we call ensembles, include ...
Michael P. Ashley-Rollman, Peter Lee, Seth Copen G...
74
Voted
JSAC
2008
116views more  JSAC 2008»
14 years 9 months ago
Stability and Efficiency of Unstructured File Sharing Networks
We propose two unstructured file sharing games, unilateral and bilateral unstructured file sharing games, to study the interaction among self-interested players (users) of unstruct...
Honggang Zhang, Giovanni Neglia, Donald F. Towsley...
MOBIHOC
2010
ACM
14 years 7 months ago
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent anal...
Simon Heimlicher, Kavé Salamatian