000 03757nam a22004095i 4500
001 307747
003 MX-SnUAN
005 20160429160145.0
007 cr nn 008mamaa
008 150903s2014 gw | o |||| 0|eng d
020 _a9783642453465
_99783642453465
024 7 _a10.1007/9783642453465
_2doi
035 _avtls000362348
039 9 _a201509030632
_bVLOAD
_c201405070328
_dVLOAD
_y201402211047
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aFlocchini, Paola.
_eeditor.
_9330569
245 1 0 _aAlgorithms for Sensor Systems :
_b9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers /
_cedited by Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _ax, 307 páginas 91 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8243
500 _aSpringer eBooks
505 0 _aModeling 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.
520 _aThis book constitutes the proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2013, held in Sophia Antipolis, France, in September 2013. The 19 papers presented in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aGao, Jie.
_eeditor.
_9347483
700 1 _aKranakis, Evangelos.
_eeditor.
_9333611
700 1 _aMeyer auf der Heide, Friedhelm.
_eeditor.
_9340237
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642453458
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-45346-5
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c307747
_d307747