Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms for Sensor Systems: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers de Falko Dressler

Algorithms for Sensor Systems: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, Munich, Germany, September 12–13, 2019, Revised Selected Papers: Lecture Notes in Computer Science, cartea 11931

Editat de Falko Dressler, Christian Scheideler
en Limba Engleză Paperback – 19 noi 2019
This book constitutes revised selected papers from the 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019, held in Munich, Germany, in September 2019.
The 11 full papers presented in this volume were carefully reviewed and selected from 16 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31120 lei

Preț vechi: 38899 lei
-20% Nou

Puncte Express: 467
Preț estimativ în valută:
5957€ • 6405$ • 4966£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783030344047
ISBN-10: 3030344045
Pagini: 250
Ilustrații: VIII, 207 p. 98 illus., 29 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.31 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Computer Communication Networks and Telecommunications

Locul publicării:Cham, Switzerland

Cuprins

Mobility Management.- Evacuation of equilateral triangles by mobile agents of limited communication range.- Fast Dispersion of Mobile Robots on Arbitrary Graphs.- Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable Matter.- Foundations.- Existence of Connected Intersection-Free Subgraphs in Graphs with Redundancy and Coexistence Property.- Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography.- Reception Capacity: Definitions, Game Theory and Hardness.- Wireless Communication.- Collaborative Broadcast in O(log log n) Rounds.- Multi-Channel Assignment and Link Scheduling for Prioritized Latency-Sensitive Applications.- Throughput and Packet Displacements of Dynamic Broadcasting Algorithms.- Faulty Robots.- Chauffeuring a Crashed Robot from a Disk.- Optimal Cycle Search Despite the Presence of Faulty Robots.