1 option
Algorithmics of Wireless Networks : 20th International Symposium, ALGOWIN 2024, Egham, UK, September 5–6, 2024, Proceedings / edited by Quentin Bramas, Arnaud Casteigts, Kitty Meeks.
Springer Nature - Springer Computer Science (R0) eBooks 2025 English International Available online
View online- Format:
- Book
- Author/Creator:
- Bramas, Quentin.
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 15026
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer engineering.
- Computer networks.
- Artificial intelligence.
- Design and Analysis of Algorithms.
- Computer Engineering and Networks.
- Artificial Intelligence.
- Local Subjects:
- Design and Analysis of Algorithms.
- Computer Engineering and Networks.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (213 pages)
- Edition:
- 1st ed. 2025.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
- Summary:
- This book constitutes the refereed proceedings of the 20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024, held in Egham, UK, in September 2024. The 14 full papers presented here were carefully reviewed and selected from 26 submissions. These papers focus on the Algorithmic aspects of Wireless networks, including the design and analysis of Algorithms, Models of computation and Experimental analysis, involved in various types of computational entities.
- Contents:
- Collision Free Robot Scheduling
- On the Exponential Growth of Geometric Shapes
- Optimizing Robot Dispersion on Unoriented Grids with and without Fault Tolerance
- Channel allocation revisited through 1 extendability of graphs
- On the Min Max Star Partitioning Number
- Collision Detection for Modular Robots it is easy to cause collisions and hard to avoid them
- Bike Assisted Evacuation on a Line of Robots with Communication Faults
- On Permutation Selectors and Their Applications in Ad Hoc Radio Networks Protocols
- Reconfigurable routing in data center networks
- The threshold of existence of delta temporal cliques in random simple temporal graphs
- The Exact Spanning Ratio of the Parallelogram Delaunay Graph
- A 1.5 approximation algorithm for activating 2 disjoint st paths
- Modular population protocols
- Decreasing verification radius in local certification.
- Notes:
- Description based on publisher supplied metadata and other sources.
- ISBN:
- 9783031745805
- 3031745809
- OCLC:
- 1482309012
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.