000 | 03411nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-92862-1 | ||
003 | DE-He213 | ||
005 | 20240423125851.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2008 gw | s |||| 0|eng d | ||
020 |
_a9783540928621 _9978-3-540-92862-1 |
||
024 | 7 |
_a10.1007/978-3-540-92862-1 _2doi |
|
050 | 4 | _aTK5105.5-5105.9 | |
072 | 7 |
_aUKN _2bicssc |
|
072 | 7 |
_aCOM043000 _2bisacsh |
|
072 | 7 |
_aUKN _2thema |
|
082 | 0 | 4 |
_a004.6 _223 |
245 | 1 | 0 |
_aAlgorithmic Aspects of Wireless Sensor Networks _h[electronic resource] : _bFourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers / _cedited by Sandor P. Fekete. |
250 | _a1st ed. 2008. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2008. |
|
300 |
_aXI, 151 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aComputer Communication Networks and Telecommunications, _x2945-9184 ; _v5389 |
|
505 | 0 | _aAlgorithms for Sensor Networks: What Is It Good for? -- Tight Local Approximation Results for Max-Min Linear Programs -- Minimizing Average Flow Time in Sensor Data Gathering -- Target Counting under Minimal Sensing: Complexity and Approximations -- Efficient Scheduling of Data-Harvesting Trees -- Link Scheduling in Local Interference Models -- Algorithms for Location Estimation Based on RSSI Sampling -- Random Fault Attack against Shrinking Generator -- Probabilistic Protocols for Fair Communication in Wireless Sensor Networks -- Simple Robots in Polygonal Environments: A Hierarchy -- Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments -- Optimal Backlog in the Plane. | |
520 | _aThis book constitutes the reviewed proceedings of the Fourth International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS 2008, held in Reykjavik, Iceland, Wroclaw, Poland, July 12, 2008. The workshops aimed at bringing together research contributions related to diverse algorithmic and complexity-theoretic aspects of wireless sensor networks. The topics include but are not limited to optimization problems, noise and probability, robots and tours. | ||
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 1 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Science. |
700 | 1 |
_aFekete, Sandor P. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540928614 |
776 | 0 | 8 |
_iPrinted edition: _z9783540928638 |
830 | 0 |
_aComputer Communication Networks and Telecommunications, _x2945-9184 ; _v5389 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-92862-1 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c182544 _d182544 |