30 search results - page 4 / 6 » podc 2004 |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
PODC
2004
ACM
14 years 26 days ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
PODC
2004
ACM
14 years 26 days ago
2004
ACM
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
PODC
2004
ACM
14 years 26 days ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
PODC
2004
ACM
14 years 26 days ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...