66 search results - page 10 / 14 » Theoretic study of distributed graph planning |
PERCOM
2004
ACM
14 years 6 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
SAGT
2009
Springer
14 years 1 months ago
2009
Springer
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with soc...