Page 1

Displaying 1 – 4 of 4

Showing per page

Solving maximum independent set by asynchronous distributed hopfield-type neural networks

Giuliano Grossi, Massimo Marchi, Roberto Posenato (2006)

RAIRO - Theoretical Informatics and Applications

We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better than the...

Space-efficient parallel merging

J. Katajainen, C. Levcopoulos, O. Petersson (1993)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Spatially-distributed coverage optimization and control with limited-range interactions

Jorge Cortés, Sonia Martínez, Francesco Bullo (2005)

ESAIM: Control, Optimisation and Calculus of Variations

This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...

Spatially-distributed coverage optimization and control with limited-range interactions

Jorge Cortés, Sonia Martínez, Francesco Bullo (2010)

ESAIM: Control, Optimisation and Calculus of Variations

This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius.
Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time.
These algorithms have convergence guarantees and are spatially distributed with...

Currently displaying 1 – 4 of 4

Page 1