|
|
|
|
LEADER |
03271nam a22005655i 4500 |
001 |
978-3-540-92862-1 |
003 |
DE-He213 |
005 |
20170130084206.0 |
007 |
cr nn 008mamaa |
008 |
100301s2008 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540928621
|9 978-3-540-92862-1
|
024 |
7 |
|
|a 10.1007/978-3-540-92862-1
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a TK5105.5-5105.9
|
072 |
|
7 |
|a UKN
|2 bicssc
|
072 |
|
7 |
|a COM075000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.6
|2 23
|
245 |
1 |
0 |
|a Algorithmic Aspects of Wireless Sensor Networks
|h [electronic resource] :
|b Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers /
|c edited by Sándor P. Fekete.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2008.
|
300 |
|
|
|a XI, 151 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5389
|
505 |
0 |
|
|a Algorithms 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 |
|
|
|a This 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 |
|a Computer science.
|
650 |
|
0 |
|a Computer communication systems.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Computers.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Information Systems and Communication Service.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Data Structures.
|
700 |
1 |
|
|a Fekete, Sándor P.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540928614
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5389
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-92862-1
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|