Pages that link to "Item:Q3195234"
From MaRDI portal
The following pages link to Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234):
Displayed 10 items.
- Optimal search and ambush for a hider who can escape the search region (Q322755) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- (Q5131476) (← links)