Pages that link to "Item:Q5941439"
From MaRDI portal
The following pages link to The ultimate strategy to search on \(m\) rays? (Q5941439):
Displaying 19 items.
- Searching for an axis-parallel shoreline (Q443717) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Competitive search in a network (Q2184175) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Search Games: A Review (Q2961390) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Online search with a hint (Q6186319) (← links)
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs (Q6195335) (← links)
