The following pages link to Patrolling a perimeter (Q1926970):
Displaying 21 items.
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- Multithreat multisite protection: a security case study (Q322995) (← links)
- Ambush and active search in multistage predator-prey interactions (Q493043) (← links)
- Optimizing periodic patrols against short attacks on the line and other networks (Q1631529) (← links)
- Security games with probabilistic constraints on the agent's strategy (Q1675470) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- Continuous patrolling and hiding games (Q1735165) (← links)
- A Monte Carlo tree search approach to finding efficient patrolling schemes on graphs (Q1735189) (← links)
- Risk-averse stochastic path detection (Q1753422) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Patrolling a Border (Q2957456) (← links)
- Tools to Manage Search Games on Lattices (Q2961392) (← links)
- The Cardinality of the Sets Involved in Lattice Games (Q2961397) (← links)
- SEARCHING A ROOM BY TWO GUARDS (Q4818565) (← links)
- Adversarial Patrolling in a Uniform (Q5031004) (← links)
- Technical Note—Optimal Patrol of a Perimeter (Q5058049) (← links)
- Continuous Patrolling Games (Q5060487) (← links)
- Guarding a terrain by two watchtowers (Q5370631) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)
- A review of attacker-defender games: current state and paths forward (Q6555126) (← links)
