
doi: 10.1007/bf01965719
A class of one-dimensional search problems is considered. The formulation results in a functional-minimization equation of the dynamic programming type. In the case of a uniform a priori distribution for the location of the hidden object an optimality criterion is established and the optimal search procedure is found.
optimal search, dynamic programming, Applications of mathematical programming, 330, optimality criterion, Search theory, Dynamic programming, one-dimensional search
optimal search, dynamic programming, Applications of mathematical programming, 330, optimality criterion, Search theory, Dynamic programming, one-dimensional search
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
