The following pages link to Parallel searching on \(m\) rays (Q5943313):
Displaying 13 items.
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Parallel searching of multidimensional cubes (Q685702) (← links)
- Parallel searching in generalized Monge arrays (Q1386363) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Parallel searching in the plane (Q1903637) (← 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)
- More Efficient Parallel Totally Monotone Matrix Searching (Q4339010) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)