Fault-tolerant flocking in a k-bounded asynchronous system
スポンサーリンク
概要
- 論文の詳細を見る
- 北陸先端科学技術大学院大学の論文
- 2008-09-26
著者
-
Defago Xavier
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Defago Xavier
School Of Information Science Jaist
-
Souissi Samia
School of Information Science, Japan Advanced Institute of Science and Technology (JAIST)
-
Yang Yan
School of Information Science, Japan Advanced Institute of Science and Technology
-
Souissi Samia
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Yang Yan
School Of Information Science Japan Advanced Institute Of Science And Technology
関連論文
- Anonymous stabilizing leader election using a network sequencer
- An SNMP based failure detection service
- ED FD: Improving the phi accrual failure detector
- Self-stabilizing algorithm for circle formation by disoriented oblivious mobile robots
- Concurrency in Microprotocol Frameworks
- Definition and specification of accrual failure detectors
- On Accrual Failure Detectors
- The φ Accrual Failure Detector
- Flexible Failure Detection with к-FD
- A lazy routing protocol for large-scale mobile ad hoc networks
- Specification of Replication Techniques,Semi-Passive Replication,and Lazy Consensus
- Collision prevention using group communication for asynchronous cooperative mobile robots
- Locality-preserving distributed path reservation protocol for asynchronous cooperative mobile robots
- Tight bound on the gathering of two oblivious mobile robots with inconsistent compasses
- Gathering asychronous mobile robots with inaccurate compasses
- Eventually consistent compasses for robust gathering of asynchronous mobile robots with limited visibility
- A sowing routing protocol for dense mobile ad hoc networks
- Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms
- Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey
- Distributed Algorithm for Circle Formation of Disoriented Mobile Robots
- Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems
- Fault-tolerant flocking in a k-bounded asynchronous system