SOME SPECIAL SEARCH PROBLEMS

Abstract

Intuitively, one thinks of a search problem as a puzzle requiring for its solution an efficient technique or algorithm for locating or gaining desirable information about some object. The object may be a physical one or perhaps purely mathematical in character. Without attempting to define precisely what is meant by a search problem per se, (this we leave to the Logicians) the author illustrates various categories and aspects, e.g., game theoretic, sequential minimax, etc., by means of particular typical problems he and his colleague Selmer Johnson, et. al., have solved at RAND.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 20, 1959
Accession Number
AD0616377

Entities

People

  • O. Gross

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Computer Programming
  • Computers
  • Digital Computers
  • Dynamic Programming
  • Equations
  • Game Theory
  • Ground Level
  • Hard Copy
  • Information Theory
  • Intervals
  • Personality
  • Probability
  • Rational Functions
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Computational Linguistics
  • Educational Psychology