Cantitate/Preț
Produs

Principles of Distributed Systems: 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4878

Editat de Eduardo Tovar, Philippas Tsigas, Hacène Fouchal
en Limba Engleză Paperback – 30 noi 2007

Din seria Lecture Notes in Computer Science

Preț: 33606 lei

Preț vechi: 42008 lei
-20% Nou

Puncte Express: 504

Preț estimativ în valută:
6431 6681$ 5342£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540770954
ISBN-10: 354077095X
Pagini: 478
Ilustrații: XIII, 466 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.71 kg
Ediția:2007
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ă

Professional/practitioner

Cuprins

A Decentralized, Scalable, and Autonomous Grid Monitoring System.- A Formal Analysis of the Deferred Update Technique.- ASAP: A Camera Sensor Network for Situation Awareness.- Asynchronous Active Recommendation Systems.- Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks.- Byzantine Consensus with Few Synchronous Links.- Clock Synchronization in the Byzantine-Recovery Failure Model.- Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots.- Deterministic Communication in the Weak Sensor Model.- Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System.- Distance Sensitive Snapshots in Wireless Sensor Networks.- Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.- Does Clock Precision Influence ZigBee’s Energy Consumptions?.- From an Intermittent Rotating Star to a Leader.- Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems.- LFthreads: A Lock-Free Thread Library.- Making Distributed Applications Robust.- Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks.- N-Consensus is the Second Strongest Object for N?+?1 Processes.- Non-Searchability of Random Power-Law Graphs.- O(logn)-Time Overlay Network Construction from Graphs with Out-Degree 1.- On the Self-stabilization of Mobile Robots in Graphs.- Peer to Peer Multidimensional Overlays: Approximating Complex Structures.- Secretive Birds: Privacy in Population Protocols.- Self-stabilizing and Byzantine-Tolerant Overlay Network.- Separability to Help Parallel Simulation of Distributed Computations.- Small-World Networks: From Theoretical Bounds to Practical Systems.- The Anonymous Consensus Hierarchy and NamingProblems.- The Baskets Queue.- The Cost of Monotonicity in Distributed Graph Searching.- Timed Quorum Systems for Large-Scale and Dynamic Environments.- Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?.