Pages that link to "Item:Q3964313"
From MaRDI portal
The following pages link to Discrete Sequential Search with Positive Switch Cost (Q3964313):
Displaying 9 items.
- Optimal search with positive switch cost is NP-hard (Q1065706) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← links)
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- A search game with unknown examination costs and travel times (Q2875628) (← links)
- Technical Note—Trading Off Quick versus Slow Actions in Optimal Search (Q3453336) (← links)
- A search problem with considering posterior treatments for a detected object (Q5293406) (← links)