Principles of Distributed Systems: 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4305
Editat de Alexander A. Shvartsmanen Limba Engleză Paperback – 27 noi 2006
Din seria Lecture Notes in Computer Science
- 20% Preț: 741.34 lei
- 20% Preț: 340.22 lei
- 20% Preț: 343.43 lei
- 20% Preț: 315.18 lei
- 20% Preț: 327.41 lei
- 20% Preț: 1031.06 lei
- 20% Preț: 438.67 lei
- 20% Preț: 315.76 lei
- 20% Preț: 330.61 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 995.03 lei
- 20% Preț: 562.71 lei
- 20% Preț: 237.99 lei
- 20% Preț: 504.57 lei
- 20% Preț: 332.20 lei
- 15% Preț: 563.85 lei
- 20% Preț: 636.26 lei
- 5% Preț: 365.59 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.38 lei
- Preț: 370.38 lei
- 20% Preț: 172.68 lei
- 20% Preț: 315.76 lei
- 20% Preț: 662.78 lei
- 20% Preț: 256.26 lei
- 20% Preț: 440.36 lei
- 20% Preț: 626.79 lei
- 20% Preț: 566.70 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 579.38 lei
- 20% Preț: 301.94 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 330.61 lei
- 20% Preț: 1044.38 lei
- 20% Preț: 574.58 lei
- Preț: 399.17 lei
- 20% Preț: 802.24 lei
- 20% Preț: 569.11 lei
- 20% Preț: 1374.12 lei
- 20% Preț: 333.84 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.97 lei
Preț: 330.94 lei
Preț vechi: 413.67 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
63.33€ • 66.61$ • 52.76£
63.33€ • 66.61$ • 52.76£
Carte tipărită la comandă
Livrare economică 04-18 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540499909
ISBN-10: 3540499903
Pagini: 460
Ilustrații: XIV, 450 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.64 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540499903
Pagini: 460
Ilustrații: XIV, 450 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.64 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Lazy and Speculative Execution in Computer Systems.- In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement.- A Topological Treatment of Early-Deciding Set-Agreement.- Renaming with k-Set-Consensus: An Optimal Algorithm into n + k – 1 Slots.- When Consensus Meets Self-stabilization.- On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention.- Optimistic Algorithms for Partial Database Replication.- Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems.- Distributed Priority Inheritance for Real-Time and Embedded Systems.- Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover.- Lock-Free Dynamically Resizable Arrays.- Distributed Spanner Construction in Doubling Metric Spaces.- Verification Techniques for Distributed Algorithms.- Mobile Agent Algorithms Versus Message Passing Algorithms.- Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.- Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks.- Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms.- Glance: A Lightweight Querying Service for Wireless Sensor Networks.- On Many-to-Many Communication in Packet Radio Networks.- Robust Random Number Generation for Peer-to-Peer Systems.- About the Lifespan of Peer to Peer Networks.- Incentive-Based Robust Reputation Mechanism for P2P Services.- Searching for Black-Hole Faults in a Network Using Multiple Agents.- Gathering Asynchronous Mobile Robots with Inaccurate Compasses.- Gathering Few Fat Mobile Robots in the Plane.- Hop Chains: Secure Routing and the Establishment of Distinct Identities.- Computing on a PartiallyEponymous Ring.- Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents.- Robust Self-stabilizing Clustering Algorithm.- Self-stabilizing Wireless Connected Overlays.