An Optimal Search Problem
From MaRDI portal
Cited in
(16)- Optimal search paths for random variables
- Star search -- a different show
- Dynamic programming and the backpacker's linear search problem
- Lower bounds for searching robots, some faulty
- Search and delivery man problems: when are depth-first paths optimal?
- Competitive clustering of stochastic communication patterns on a ring
- Son of the linear search problem
- Existence of a periodic search strategy for a parabolic spiral target motion in the plane
- Optimal searching for a Helix target motion
- Yet more on the linear search problem
- On the minimality of search paths under absolutely continuous univariate distributions
- Searching for the random walking microorganism cells
- Lower bounds in on-line geometric searching
- Multiplicative linear search for a Brownian target motion
- A Study on the Finiteness of a Tracking Method with Reduction in the Collision Time between a D-Dimensional Random Walk Particle and One of Multiple Nano-Sensors
- Optimal multiplicative generalized linear search plan for a discrete random walker
This page was built for publication: An Optimal Search Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510386)
