Algorithms for Sensor Systems
Editat de Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer Auf Der Heideen Limba Engleză Paperback – 7 ian 2014
Preț: 322.19 lei
Preț vechi: 402.73 lei
-20% Nou
Puncte Express: 483
Preț estimativ în valută:
57.01€ • 66.94$ • 50.04£
57.01€ • 66.94$ • 50.04£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642453458
ISBN-10: 3642453457
Pagini: 320
Ilustrații: X, 307 p. 91 illus.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642453457
Pagini: 320
Ilustrații: X, 307 p. 91 illus.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Modeling Reality Algorithmically: The Case of Wireless Communication.- Autonomous Mobile Robots: A Distributed Computing.- Token Dissemination in Geometric Dynamic Networks.- The Wake Up Dominating Set.- Reconfiguring Massive Particle Swarms with Limited, Global Control.- Polygon-Constrained motion planning problems.- Fast Localized Sensor Self-Deployment for Focused Coverage.- Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration.- Data-Delivery by Energy-Constrained Mobile Robots.- Approximation Bounds for the Minimum k-Storage Problem.- Counting in Anonymous Dynamic Networks: An Experimental Perspective.- Station Assignment with Applications to Sensing.- On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model.- The Effect of Forgetting on the Performance of a Synchronizer.- On the Complexity of Barrier Resilience for Fat Regions.- A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.- Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes.- On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks.- Optimal Nearest Neighbor Queries in Sensor Networks.- Conflict Graphs and the Capacity of the Mean Power Scheme.- Rendezvous of Two Robots with Visible Bits.
Caracteristici
Includes supplementary material: sn.pub/extras