The following pages link to Xavier Défago (Q656599):
Displaying 13 items.
- The cost of probabilistic agreement in oblivious robot networks (Q656601) (← links)
- Semi-passive replication and lazy consensus (Q705563) (← links)
- Tight bound on mobile Byzantine agreement (Q897904) (← links)
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity (Q924138) (← links)
- Killing nodes as a countermeasure to virus expansion (Q1742780) (← links)
- (Q2007896) (redirect page) (← links)
- Flocking with oblivious robots (Q2007897) (← links)
- Priority inheritance with backtracking for iterative multi-agent path finding (Q2163887) (← links)
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults (Q2204778) (← links)
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses (Q2884572) (← links)
- (Q5091102) (← links)
- Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights (Q6057840) (← links)
- Solving simultaneous target assignment and path planning efficiently with time-independent execution (Q6108766) (← links)
