The following pages link to (Q5501793):
Displaying 8 items.
- Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Impact of topographic information on graph exploration efficiency (Q4519131) (← links)
- Moving an angle around a region (Q5054844) (← links)