The return of the linear search problem
The return of the linear search problem
复制标题
线性搜索问题的回归
DOI：
--
复制
发表时间：
1973
期刊：
影响因子：
--
通讯作者：
P. Warren
中科院分区：
文献类型：
--
作者：
A. Beck;P. Warren
线性搜索问题是在实线上根据给定的概率分布随机选择一个点的搜索问题。搜索从零开始，以恒定的速度连续运动，先朝一个方向，然后朝另一个方向。问题在于确定何时可以设计出“最佳”搜索计划。在以往的文献中，最优方案是根据最小期望路径长度的准则来选择的。在本文中，我们考虑了“最佳”计划的一个更一般的非线性准则，并表明早期结果的实质性要求不受这些变化的影响。
The linear search problem concerns a search on the real line for a point selected at random according to a given probability distribution. The search begins at zero and is made by a continuous motion with constant speed, first in one direction and then the other. The problem is to determine when it is possible to devise a “best” search plan. In former papers the best plan has been selected according to the criterion of minimum expected path length. In this paper we consider a more general, nonlinear criterion for a “best” plan and show that the substantive requirements of the earlier results are not affected by these changes.