Pages that link to "Item:Q1879364"
From MaRDI portal
The following pages link to A distributed ant algorithm for efficiently patrolling a network (Q1879364):
Displayed 27 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051) (← links)
- Multi-robot area patrol under frequency constraints (Q693285) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Total variation discrepancy of deterministic random walks for ergodic Markov chains (Q1675930) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder (Q1761280) (← links)
- Simple strategies versus optimal schedules in multi-agent patrolling (Q2196578) (← links)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← links)
- The cover time of deterministic random walks for general transition probabilities (Q2310755) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Monitoring the plane with rotating radars (Q2345510) (← links)
- Fence patrolling by mobile agents with distinct speeds (Q2353252) (← links)
- Time and space optimality of rotor-router graph exploration (Q2398496) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Lower Bounds for Graph Exploration Using Local Policies (Q2803810) (← links)
- Distributed Patrolling with Two-Speed Robots (and an Application to Transportation) (Q2980175) (← links)
- Coalescing Walks on Rotor-Router Systems (Q3460734) (← links)
- The Range of a Rotor Walk (Q4576529) (← links)
- Deterministic Random Walks for Rapidly Mixing Chains (Q4584953) (← links)
- Unbounded Discrepancy of Deterministic Random Walks on Grids (Q4691168) (← links)
- Exploration of Time-Varying Connected Graphs with Silent Agents (Q5100956) (← links)
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (Q5175230) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Fast two-robot disk evacuation with wireless communication (Q5915701) (← links)
- Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles (Q6155234) (← links)