Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
Cyril Banino-Rokkones, Olivier Beaumont, Lasse Nat...
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...