Linear search problem

In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman. (independently…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

In STOC'16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by…

2014

List accessing problem is seen as a self-organizing linear search problem. The dilemma is to access a sequence of requests from…

2013

2011

The linear search problem is studied from the view point of Hamiltonian dynamics. For the specific, yet representative case of…

2010

In this paper we derive the control policy that minimizes the total expected time for a point mass with bounded acceleration…

2009

In this paper we investigate discrete linear search and graph search problems. It is well-known that the Bounded Discrete Linear…

2000

Inthis paper we introduce a new class of search problem which wecall `alternating search'. Two searchers starting at given…

1999

We apply a new method of analysis to the asymmetric rendezvous search problem on the line (ARSPL). This problem, previously…

1994

Considers the optimal search problems in which a pair of searchers seek to minimize the expected time taken to find each other…

1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by…