• DocumentCode
    901047
  • Title

    A frame architecture for a certain class of graph search problems

  • Author

    Sy, Bon K. ; Deller, J.R., Jr.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
  • Volume
    18
  • Issue
    5
  • fYear
    1988
  • Firstpage
    815
  • Lastpage
    824
  • Abstract
    A frame control strategy is presented which directs an efficient graph search when information available for finding a path is distributed throughout the graph. The frame structure requires (worst case) only O(KN) memory size instead of O(K 2N), which is needed for a matrix representation of an N -level, K-branch tree graph. An efficiency analysis is detailed, and its application to a communication system for the nonverbal, severely motor disabled is discussed
  • Keywords
    artificial intelligence; graph theory; search problems; trees (mathematics); artificial intelligence; efficiency analysis; frame architecture; frame control strategy; graph search; handicapped aids; tree; Artificial intelligence; Associative memory; Data mining; Hilbert space; Matrix decomposition; Optimal control; Polynomials; Search problems; Singular value decomposition; Vectors;
  • fLanguage
    English
  • Journal_Title
    Systems, Man and Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9472
  • Type

    jour

  • DOI
    10.1109/21.21608
  • Filename
    21608
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=901047