| TÃtulo : |
26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Censor-Hillel, Keren, ; Flammini, Michele, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2019 |
| Número de páginas: |
XXI, 368 p. 301 ilustraciones, 26 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-24922-9 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Algoritmos IngenierÃa Informática Red de computadoras Sistemas operativos (computadoras) Robótica Informática Matemáticas discretas Inteligencia artificial IngenierÃa Informática y Redes Sistemas operativos Matemáticas discretas en informática Ciencia de los datos |
| Clasificación: |
|
| Resumen: |
Este libro constituye las actas de la conferencia arbitrada del 26º Coloquio Internacional sobre Complejidad de la Información y la Comunicación Estructural, SIROCCO 2019, celebrado en L''Aquila, Italia, en julio de 2019. Los 19 artÃculos completos y 9 artÃculos breves presentados en este libro fueron cuidadosamente revisados ​​y seleccionado entre 39 presentaciones. Están dedicados al estudio de la interacción entre el conocimiento estructural, la comunicación y la informática en sistemas descentralizados de múltiples entidades comunicantes. |
| Nota de contenido: |
A Topological Perspective on Distributed Network Algorithms -- On Sense of Direction and Mobile Agents -- Locality of not-so-weak coloring -- Near-gathering of energy-constrained mobile agents -- Optimal Multi Broadcast with Beeps using Group Testing -- Tracking Routes in Communication Networks -- Positional Encoding by Robots with Non-Rigid Movements -- Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights -- Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory -- Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots -- Asynchronous Rendezvous with Different Maps -- Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies -- Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model -- Evacuating Two Robots from a Disk: A Second Cut -- Distributed pattern formation in a ring -- On Distributed Merlin-Arthur Decision Protocols -- Anonymous Read/Write Memory: Leader Election and Desanonymization -- Faster Construction of Overlay Networks -- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings -- Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects -- Making Randomized Algorithms Self-Stabilizing -- How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning -- Self-Adjusting Line Networks -- Mutual Visibility for Asynchronous Robots -- Infinite Grid Exploration by Disoriented Robots -- A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks -- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds -- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault -- Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time -- Visiting Infinitely Often the Unit Interval while Minimizing the Idle-time of High Priority Points. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings [documento electrónico] / Censor-Hillel, Keren, ; Flammini, Michele, . - 1 ed. . - [s.l.] : Springer, 2019 . - XXI, 368 p. 301 ilustraciones, 26 ilustraciones en color. ISBN : 978-3-030-24922-9 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Algoritmos IngenierÃa Informática Red de computadoras Sistemas operativos (computadoras) Robótica Informática Matemáticas discretas Inteligencia artificial IngenierÃa Informática y Redes Sistemas operativos Matemáticas discretas en informática Ciencia de los datos |
| Clasificación: |
|
| Resumen: |
Este libro constituye las actas de la conferencia arbitrada del 26º Coloquio Internacional sobre Complejidad de la Información y la Comunicación Estructural, SIROCCO 2019, celebrado en L''Aquila, Italia, en julio de 2019. Los 19 artÃculos completos y 9 artÃculos breves presentados en este libro fueron cuidadosamente revisados ​​y seleccionado entre 39 presentaciones. Están dedicados al estudio de la interacción entre el conocimiento estructural, la comunicación y la informática en sistemas descentralizados de múltiples entidades comunicantes. |
| Nota de contenido: |
A Topological Perspective on Distributed Network Algorithms -- On Sense of Direction and Mobile Agents -- Locality of not-so-weak coloring -- Near-gathering of energy-constrained mobile agents -- Optimal Multi Broadcast with Beeps using Group Testing -- Tracking Routes in Communication Networks -- Positional Encoding by Robots with Non-Rigid Movements -- Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights -- Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory -- Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots -- Asynchronous Rendezvous with Different Maps -- Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies -- Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model -- Evacuating Two Robots from a Disk: A Second Cut -- Distributed pattern formation in a ring -- On Distributed Merlin-Arthur Decision Protocols -- Anonymous Read/Write Memory: Leader Election and Desanonymization -- Faster Construction of Overlay Networks -- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings -- Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects -- Making Randomized Algorithms Self-Stabilizing -- How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning -- Self-Adjusting Line Networks -- Mutual Visibility for Asynchronous Robots -- Infinite Grid Exploration by Disoriented Robots -- A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks -- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds -- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault -- Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time -- Visiting Infinitely Often the Unit Interval while Minimizing the Idle-time of High Priority Points. |
| Enlace de acceso : |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
|  |
Crear una solicitud de compra Refinar búsqueda26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings / Censor-Hillel, Keren ; Flammini, Michele
