APPLICATIONS OF A PRINCIPLE OF OPTIMUM SEARCH TO SOME SPECIAL CLASSES OF SEARCH PROBLEMS,
Abstract
A search conducted in the variable x for the purpose of discovering the unknown value of a target coordinate, x = x sub T, is said to be optimum if the cumulative acquisition probability is maximum at every instant of the search. Optimum searches are obtained for problems in which: x sub T = u, where u is a stationary random variable; x sub T = vt, where v is a stationary random variable and t = or > 0 denotes time; x sub T = u + vt, where u and v are stationary, independent random variables with uniform probability density distributions. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 03, 1960
- Accession Number
- AD0654334
Entities
People
- V. Schwab
Organizations
- Johns Hopkins University Applied Physics Laboratory