The following pages link to Online searching with turn cost (Q2503358):
Displaying 8 items.
- Weighted online search (Q6133641) (← links)
- Optimal circle search despite the presence of faulty robots (Q6161451) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)
- Online search with a hint (Q6186319) (← links)
- Evacuation of equilateral triangles by mobile agents of limited communication range (Q6536151) (← links)
- Optimal circle search despite the presence of faulty robots (Q6536163) (← links)
- Competitive searching over terrains (Q6547937) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6614002) (← links)