549 search results - page 30 / 110 » Computing All the Best Swap Edges Distributively |
ATAL
2006
Springer
15 years 1 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...
JAL
2006
14 years 9 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
FOCS
1997
IEEE
15 years 1 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
101
click to vote
SIGCOMM
2012
ACM
13 years 4 days ago
2012
ACM
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...