Algorithmics of Wireless Networks

18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8–9, 2022, Proceedings

AvThomas Erlebach,Michael Segal

Häftad, Engelska, 2022

Del 13707 i serien Lecture Notes in Computer Science

629 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithmics of Wireless Network, ALGOSENSORS 2022, which took place in Potsdam, Germany in September 2022.The 10 full papers presented in this volume were carefully reviewed and selected from 21 submissions. ALGOSENSORS is an international symposium dedicated to algorithmic aspects of wireless networks.

Produktinformation

Utgivningsdatum:2022-12-13
Mått:155 x 235 x 10 mm
Vikt:260 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:153
Förlag:Springer International Publishing AG
ISBN:9783031220494

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Nätverk och kommunikation inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

On Geometric Shape Construction via Growth Operations.- Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone.- Blackout-tolerant Temporal Spanners.- Molecular robots with chirality on grids.- Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes.- Triangle Evacuation of 2 Agents in the Wireless Model.- Resource time-sharing for IoT applications with deadlines.- Fault-Tolerant Graph Realizations in the Congested Clique.- The Complexity of Growing a Graph.- Dispersing Facilities on Planar Segment and Circle Amidst Repulsion.

Du kanske också är intresserad av

Algorithmics of Wireless Networks

Michael Segal, Thomas Erlebach

E-bok

2022

821 kr

Algorithmics of Wireless Networks

Thomas Erlebach, Michael Segal

Häftad, 2022

672 kr

Del 13471

Wireless Algorithms, Systems, and Applications

Lei Wang, Michael Segal, Jenhui Chen, Tie Qiu

Häftad, 2022

1 105 kr

Psychiatrists of Phoenix Street

Michael Segal

E-bok

2014

75 kr

Graph-Theoretic Concepts in Computer Science

Daniel Paulusma, Tom Friedetzky, Thomas Erlebach, Hajo Broersma

E-bok

2008

718 kr

Algorithms for Sensor Systems

Thomas Erlebach, Sotiris Nikoletseas, Pekka Orponen

Häftad, 2012

572 kr

Approximation and Online Algorithms

Giuseppe Persiano, Thomas Erlebach

E-bok

2013

718 kr

Del 11312

Approximation and Online Algorithms

Leah Epstein, Thomas Erlebach

Häftad, 2018

556 kr

Psychiatrists of Phoenix Street

Michael Segal

Häftad, 2014

306 kr

Algorithms - ESA 2006

Thomas Erlebach, Yossi Azar

E-bok

2006

1 427 kr

Algorithmics of Wireless Networks

18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8–9, 2022, Proceedings

AvThomas Erlebach,Michael Segal

Häftad, Engelska, 2022

Del 13707 i serien Lecture Notes in Computer Science

629 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:2022-12-13
Mått:155 x 235 x 10 mm
Vikt:260 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:153
Förlag:Springer International Publishing AG
ISBN:9783031220494

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Nätverk och kommunikation inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

On Geometric Shape Construction via Growth Operations.- Optimal and Heuristic Algorithms for Data Collection by Using an Energy- and Storage-Constrained Drone.- Blackout-tolerant Temporal Spanners.- Molecular robots with chirality on grids.- Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes.- Triangle Evacuation of 2 Agents in the Wireless Model.- Resource time-sharing for IoT applications with deadlines.- Fault-Tolerant Graph Realizations in the Congested Clique.- The Complexity of Growing a Graph.- Dispersing Facilities on Planar Segment and Circle Amidst Repulsion.