Treeless Searches.

Abstract

There are natural heuristics for partial enumeration, that are not based on tree structures for guiding the enumerative search, nor can these heuristics be implemented in any tree-search framework. Means for redrawing the tree are provided, when the current state of a tree search makes it desirable to utilize a different tree representation of current information.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1976
Accession Number
ADA059907

Entities

People

  • C. E. Blair
  • Robert G. Jeroslow

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms
  • Counter IED

DTIC Thesaurus Topics

  • Algorithms
  • Automatic
  • Computer Programming
  • Contracts
  • Fungi
  • Heuristic Methods
  • Inequalities
  • Integrals
  • Intervals
  • Linear Programming
  • Mathematics
  • Observation
  • Pennsylvania
  • Procedures (Computers)
  • Schools
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.