The bandwidth heuristic search

  • Authors:
  • Larry R. Harris

  • Affiliations:
  • Department of Mathematics, Dartmouth College, Hanover, New Hampshire

  • Venue:
  • IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
  • Year:
  • 1973

Quantified Score

Hi-index 0.00

Visualization

Abstract

Additive AND/OR graphs are defined as AND/ OR graphs without circuits, which can be considered as folded AND/OR trees; i. e. the cost of a common subproblem is added to the cost as many times as the subproblem occurs, but it is computed only once. Additive ...