A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Optimal Discrete Search with Imperfect Specificity
A target is hidden in one of several possible locations, and the objective is to nd the target as fast as possible. One common measure of eectiveness for the search process is the expected time of the search. This type of search optimization problem has been addressed and solved in the literature for the case where the searcher has imperfect sensitivity (possible false negative results), but perfect specicity (no false positive detections). In this paper, which is motivated by recent militarydoi:10.21236/ada598899 fatcat:syd3ez7sirdg5oourmlxxxsoym