Pages that link to "Item:Q4217305"
From MaRDI portal
The following pages link to Optimal Constructions of Hybrid Algorithms (Q4217305):
Displaying 19 items.
- 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)
- The expanding search ratio of a graph (Q1741496) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Competitive search in a network (Q2184175) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Search Games: A Review (Q2961390) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Parallel searching on \(m\) rays (Q5943313) (← links)
- Weighted online search (Q6133641) (← links)
- A nearly tight lower bound for the \(d\)-dimensional cow-path problem (Q6161449) (← links)
- Online search with a hint (Q6186319) (← links)
