Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmics of Wireless Networks: 19th International Symposium, ALGOWIN 2023, Amsterdam, The Netherlands, September 7–8, 2023, Revised Selected Papers de Konstantinos Georgiou

Algorithmics of Wireless Networks: 19th International Symposium, ALGOWIN 2023, Amsterdam, The Netherlands, September 7–8, 2023, Revised Selected Papers: Lecture Notes in Computer Science, cartea 14061

Editat de Konstantinos Georgiou, Evangelos Kranakis
en Limba Engleză Paperback – 3 dec 2023
This book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023.
The 10 full papers included in this book were carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34090 lei

Preț vechi: 42613 lei
-20% Nou

Puncte Express: 511
Preț estimativ în valută:
6031€ • 7037$ • 5273£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

 Adaugă în coș

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

Specificații

ISBN-13: 9783031488818
ISBN-10: 3031488814
Pagini: 151
Ilustrații: IX, 151 p. 46 illus., 22 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.24 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Segment Visibility for k-transmitters.- Conflict Resolution in Arbitrary Hypergraphs.- Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks.- Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements.- Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks.- WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio.- Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle.- Temporal Reachability Dominating Sets: contagion in temporal graphs.- Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information.- Run for Cover: Dominating Set via Mobile Agents.