166 search results - page 16 / 34 » A fast distributed approximation algorithm for minimum spann... |
125
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
113
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
141
click to vote
SAC
2009
ACM
15 years 7 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
130
Voted
IPPS
2010
IEEE
15 years 15 days ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
132
Voted
IJCM
2002
15 years 2 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...