flâneur

Linear search problem - Wikipedia

en.wikipedia.org · 829 words · saved by 1 readers

Join us to Celebrate Women! Help close the knowledge gender gap on Wikimedia this March: click here and see what you can do. In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman[1] and independently considered by Anatole Beck.[2][3][4] "An immobile hider is located on the real line according to a known probability distribution. A searcher, whose maximal velocity is one, starts from the origin and wishes to discover the hider in minimal expected time. It is assumed that the searcher can change the direction of his motion without any loss of time. It is also assumed that the searcher cannot see the hider until he actually reaches the point at which the hider is located and the time elapsed until this moment is the duration of the game." The problem is to find the hider in the shortest time possible. Generally, since the hider could be on either side of the searcher and an arbitrary distance away, the searcher has to o

Linear search problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Computational search problem In computational complexity theory , the linear search problem is an optimal search problem introduced by Richard E. Bellman [ 1 ] and independently considered by Anatole Beck . [ 2 ] [ 3 ] [ 4 ] The problem [ edit ] "An immobile hider is located on the real line according to a known probability distribution . A searcher, whose maximal velocity is one, starts from the origin and wishes to discover the hider in minimal expected time. It is assumed that the searcher can change the

related reading