Optimal search paths for random variables

DOI10.1016/0377-0427(83)90020-1zbMath0517.90039OpenAlexW2090914180MaRDI QIDQ1053598

Peter J. Rousseeuw

Publication date: 1983

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(83)90020-1

zbMATH Keywords

existenceapproximate solutionsnumerical methodsnormal distributionoptimal search pathhidden object on a line

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Search theory (90B40) Differential games (aspects of game theory) (91A23)

Related Items (8)

The linear search problem rides again ⋮ Dynamic programming and the backpacker's linear search problem ⋮ Optimal multiplicative generalized linear search plan for a discrete random walker ⋮ Multiplicative linear search for a Brownian target motion ⋮ Lower bounds in on-line geometric searching ⋮ Son of the linear search problem ⋮ Star search -- a different show ⋮ On the minimality of search paths under absolutely continuous univariate distributions

Cites Work

• Theory of optimal search
• On the linear search problem
• More on the linear search problem
• Yet more on the linear search problem
• The return of the linear search problem
• Searching for a particle on the real line
• An Optimal Search Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal search paths for random variables