Cantitate/Preț
Produs
Total produse
Vezi coșul
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 de Cristina M. Pinotti

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: Lecture Notes in Computer Science, cartea 12503

Editat de Cristina M. Pinotti, Alfredo Navarra, Amitabha Bagchi
en Limba Engleză Paperback – 28 oct 2020
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32762 lei

Preț vechi: 40952 lei
-20% Nou

Puncte Express: 491
Preț estimativ în valută:
6270€ • 6522$ • 5176£

Carte tipărită la comandă

Livrare economică 15-29 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030624002
ISBN-10: 3030624005
Pagini: 187
Ilustrații: IX, 187 p. 72 illus., 32 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.29 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Computer Communication Networks and Telecommunications

Locul publicării:Cham, Switzerland

Cuprins

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.