1 option
Algorithms for Sensor Systems : 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, Pisa, Italy, September 9-10, 2020, Revised Selected Papers / edited by Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Computer communication networks and telecommunications 2945-9184 ; SL 5, 12503
- Computer Communication Networks and Telecommunications, 2945-9184 ; 12503
- Language:
- English
- Subjects (All):
- Algorithms.
- Artificial intelligence.
- Computer engineering.
- Computer networks.
- Data structures (Computer science).
- Information theory.
- Design and Analysis of Algorithms.
- Artificial Intelligence.
- Computer Engineering and Networks.
- Data Structures and Information Theory.
- Local Subjects:
- Design and Analysis of Algorithms.
- Artificial Intelligence.
- Computer Engineering and Networks.
- Data Structures and Information Theory.
- Physical Description:
- 1 online resource (IX, 187 pages) : 72 illustrations, 32 illustrations in color.
- Edition:
- 1st ed. 2020.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2020.
- System Details:
- text file PDF
- Summary:
- This book constitutes revised selected papers from the 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2020, held in Pisa, Italy*, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 27 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. *The conference was held virtually due to the COVID-19 pandemic.
- Contents:
- Minimizing Total Interference in Asymmetric Sensor Networks
- Distributed Localization of Wireless Sensor Network Using Communication Wheel
- Covering users by a connected swarm efficiently
- VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
- Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
- On Efficient Connectivity-Preserving Transformations in a Grid
- Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
- Asynchronous Filling by Myopic Luminous Robots
- Weighted Group Search on a Line
- Fast Byzantine Gathering with Visibility in Graphs
- Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
- Conic Formation in Presence of Faulty Robots.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-62401-9
- 9783030624019
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.