OPTIMAL WHEREABOUTS SEARCH,

Abstract

An optimal whereabouts search maximizes the probability of correctly stating, at the end of a search costing no more than some budget C, which box contains the object. The paper shows that an optimal whereabouts search never searches the box to be guessed. An algorithm is given for finding an optimal whereabouts search strategy. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 13, 1970
Accession Number
AD0699515

Entities

People

  • Joseph B. Kadane

Organizations

  • Center for Naval Analyses

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Probability

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Speech Processing/Speech Recognition.