Algorithms for Sensor Systems: 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers: Lecture Notes in Computer Science, cartea 8847
Editat de Jie Gao, Alon Efrat, Sándor P. Fekete, Yanyong Zhangen Limba Engleză Paperback – 16 ian 2015
The 10 papers presented in this volume were carefully reviewed and selected from 20 submissions. They are organized in topical sections named: robot planning; algorithms and data structures on graphs; and wireless networks.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 579.30 lei
- Preț: 410.88 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- 15% Preț: 448.04 lei
- 20% Preț: 353.50 lei
- Preț: 389.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 645.28 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 20% Preț: 310.28 lei
- 20% Preț: 655.02 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- Preț: 449.57 lei
- 20% Preț: 591.51 lei
- 18% Preț: 938.83 lei
- 20% Preț: 337.00 lei
- 20% Preț: 649.50 lei
- 20% Preț: 607.40 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 583.40 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.49 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 17% Preț: 360.20 lei
- 20% Preț: 763.23 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.58 lei
- 20% Preț: 369.13 lei
- 20% Preț: 580.93 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- 15% Preț: 438.59 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.30 lei
Preț: 270.04 lei
Preț vechi: 337.55 lei
-20% Nou
Puncte Express: 405
Preț estimativ în valută:
51.68€ • 53.75$ • 42.66£
51.68€ • 53.75$ • 42.66£
Carte tipărită la comandă
Livrare economică 14-28 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783662460177
ISBN-10: 3662460173
Pagini: 168
Ilustrații: XI, 169 p. 43 illus.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.27 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Computer Communication Networks and Telecommunications
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662460173
Pagini: 168
Ilustrații: XI, 169 p. 43 illus.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.27 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Computer Communication Networks and Telecommunications
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Robot Planning.- The Multi-source Beachcombers Problem.- Multi-Robot Foremost Coverage of Time-Varying Graphs.- Strategies for Parallel Unaware Cleaners.- Minimum-Traveled-Distance Gathering of Oblivious Robots over Given Meeting Points.- Algorithms and Data Structures on Graphs Fast Rendezvous with Advice.- Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard.- Improved Spanners in Networks with Symmetric Directional Antennas.- Wireless Networks.- Exploiting Geometry in the SINRk Model.- Interference Minimization in Asymmetric Sensor Networks.- Minimum Latency Aggregation Scheduling in Wireless Sensor Networks.
Textul de pe ultima copertă
This book constitutes thoroughly refereed and revised selected papers from the 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, held in Wroclaw, Poland, on September 12, 2014.
The 10 papers presented in this volume were carefully reviewed and selected from 20 submissions. They are organized in topical sections named: robot planning; algorithms and data structures on graphs; and wireless networks.
The 10 papers presented in this volume were carefully reviewed and selected from 20 submissions. They are organized in topical sections named: robot planning; algorithms and data structures on graphs; and wireless networks.
Caracteristici
Includes supplementary material: sn.pub/extras