Principles of Distributed Systems: 14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings: Lecture Notes in Computer Science, cartea 6490
Editat de Chenyang Lu, Toshimitsu Masuzawa, Mohamed Mosbahen Limba Engleză Paperback – 2 dec 2010
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 332.92 lei
Preț vechi: 416.15 lei
-20%
Puncte Express: 499
Preț estimativ în valută:
58.87€ • 67.52$ • 50.89£
58.87€ • 67.52$ • 50.89£
Carte disponibilă
Livrare economică 08-22 aprilie
Specificații
ISBN-13: 9783642176524
ISBN-10: 3642176526
Pagini: 529
Ilustrații: XII, 517 p. 112 illus.
Greutate: 0.79 kg
Ediția:2010
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: 3642176526
Pagini: 529
Ilustrații: XII, 517 p. 112 illus.
Greutate: 0.79 kg
Ediția:2010
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
Robots.- Pattern Formation through Optimum Matching by Oblivious CORDA Robots.- RoboCast: Asynchronous Communication in Robot Networks.- Randomization in Distributed Algorithms.- Biased Selection for Building Small-World Networks.- Application of Random Walks to Decentralized Recommender Systems.- Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes.- Brief Announcements I.- Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths.- Self-stabilizing Byzantine Asynchronous Unison,.- Graph Algorithms.- Reliably Detecting Connectivity Using Local Graph Traits.- Distributed Game-Theoretic Vertex Coloring.- Constructing a Map of an Anonymous Graph: Applications of Universal Sequences.- Brief Announcements II.- Effect of Fairness in Model Checking of Self-stabilizing Programs.- A Formal Framework for Conformance Testing of Distributed Real-Time Systems.- Fault-Tolerance.- Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value.- A Fault Avoidance Strategy Improving the Reliability of the EGI Production Grid Infrastructure.- Failure Detectors Encapsulate Fairness.- -Based k-Set Agreement Algorithms.- Distributed Programming.- Distributed Programming with Tasks.- SkewCCC+: A Heterogeneous Distributed Hash Table.- On the Automated Implementation of Time-Based Paxos Using the IOA Compiler.- Real-Time.- Partitioning Real-Time Systems on Multiprocessors with Shared Resources.- On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors.- Tardiness Bounds for Global EDF with Deadlines Different from Periods.- Shared Memory.- Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency.- An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects.- Efficient Lock Free Privatization.- A Competitive Analysis for Balanced Transactional Memory Workloads.- Concurrency.- Fast Local-Spin Abortable Mutual Exclusion with Bounded Space.- Turning Adversaries into Friends: Simplified, Made Constructive, and Extended.- Quasi-Linearizability: Relaxed Consistency for Improved Concurrency.- A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem.- On the Message Complexity of Global Computations.- Optimizing Regenerator Cost in Traffic Grooming.- On Minimizing Average End-to-End Delay in P2P Live Streaming Systems.- Monotonic Stabilization.- Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol.- Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks.
Caracteristici
unique visibility, state-of-the-art survey, fast-track conference proceedings