Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Can frogs find large independent sets in a decentralized way? Yes they can!

Autor
Blum, C.; Blesa, M.; Calvo, B.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
9th International Conference on Swarm Intelligence
Any de l'edició
2014
Data de presentació
2014-09
Llibre d'actes
Swarm Intelligence: 9th International Conference, ANTS 2014, Brussels, Belgium, September 10-12, 2014: proceedings
Pàgina inicial
74
Pàgina final
85
Editor
Springer
DOI
https://doi.org/10.1007/978-3-319-09952-1_7 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/85203 Obrir en finestra nova
URL
http://link.springer.com/chapter/10.1007%2F978-3-319-09952-1_7 Obrir en finestra nova
Resum
The problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility location and backbone formation. In this paper we study the ability of a bio-inspired, distributed algorithm, initially proposed for graph coloring, to generate large independent sets. The inspiration of the considered algorithm stems from the self-synchronization capability of Ja...
Citació
Blum, C., Blesa, M., Calvo, B. Can frogs find large independent sets in a decentralized way? Yes they can!. A: International Conference on Swarm Intelligence. "Swarm Intelligence: 9th International Conference, ANTS 2014, Brussels, Belgium, September 10-12, 2014: proceedings". Brussels: Springer, 2014, p. 74-85.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius