Algorithmics of Wireless Networks
portes grátis
Algorithmics of Wireless Networks
18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings
Erlebach, Thomas; Segal, Michael
Springer International Publishing AG
12/2022
153
Mole
Inglês
9783031220494
15 a 20 dias
261
Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
bandwidth;communication systems;computer networks;computer systems;distributed algorithm;distributed computer systems;distributed systems;embedded systems;graph theory;mathematics;network protocols;parallel algorithms;parallel processing systems;routers;sensor networks;sensors;signal processing;telecommunication traffic;theoretical computer science;wireless telecommunication systems
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
bandwidth;communication systems;computer networks;computer systems;distributed algorithm;distributed computer systems;distributed systems;embedded systems;graph theory;mathematics;network protocols;parallel algorithms;parallel processing systems;routers;sensor networks;sensors;signal processing;telecommunication traffic;theoretical computer science;wireless telecommunication systems
