What search algorithm gives optimal average-case performance when search resources are highly limited?

No abstract is available for this paper.

• Publication year

  1986

• Venue

  27th Annual Symposium on Foundations of Computer Science (sfcs 1986)

• Publication date

  1986-10-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.1986.59
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Search with very limited resources

  1986cited by this paper
• Combinatorics, complexity, and randomness

  1986cited by this paper
• A note on the height of binary search trees

  1986cited by this paper
• Searching for an Optimal Path in a Tree with Random Costs

  1983cited by this paper
• The *-Minimax Search Procedure for Trees Containing Chance Nodes

  1983cited by this paper
• The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores

  1977cited by this paper
• Analysis of the alpha-beta pruning algorithm

  1973cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper

• No citing papers are available for this paper.