8 search results - page 1 / 2 » Brief announcement: self-assembly as graph grammar as distri... |
PODC
2009
ACM
14 years 5 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
2010
ACM
13 years 6 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
PODC
2010
ACM
13 years 6 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
PODC
2010
ACM
13 years 6 months ago
2010
ACM
In this paper, we address the problem of content placement in peer-to-peer systems, with the objective of maximizing the utilization of peers' uplink bandwidth resources. We ...
PODC
2009
ACM
13 years 9 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...