The following pages link to More on the linear search problem (Q2530991):
Displaying 22 items.
- Multiplicative linear search for a Brownian target motion (Q646171) (← links)
- Optimal multiplicative generalized linear search plan for a discrete random walker (Q896731) (← links)
- Optimal search paths for random variables (Q1053598) (← links)
- The linear search problem rides again (Q1084757) (← links)
- Star search -- a different show (Q1261911) (← links)
- Generalizations in the linear search problem (Q1895083) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Son of the linear search problem (Q2266666) (← links)
- Yet more on the linear search problem (Q2543566) (← links)
- The return of the linear search problem (Q2560025) (← links)
- Search Games: A Review (Q2961390) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- On the minimality of search paths under absolutely continuous univariate distributions (Q4735029) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- Searching for the Random Walking microorganism cells (Q5193353) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Online search with a hint (Q6186319) (← links)
- A study on the existence of a cooperative search method with reducing the first metting time between one of several nano-sensors and a Brownian particle (Q6537117) (← links)
- Overcoming probabilistic faults in disoriented linear search (Q6614002) (← links)
