• DocumentCode
    1191282
  • Title

    Path Finding with Associative Memory

  • Author

    Crane, Bently A.

  • Author_Institution
    IEEE
  • Issue
    7
  • fYear
    1968
  • fDate
    7/1/1968 12:00:00 AM
  • Firstpage
    691
  • Lastpage
    693
  • Abstract
    Abstract—This note discusses possible advantages to be gained through use of associative memory in finding the shortest path through a large graph having edges of unequal lengths. An algorithm is described which exploits associative memory´s highly parallel search and arithmetic capabilities and which is economical in storage requirements.
  • Keywords
    Index terms—Associative and content-adressable memory, graphs, highly parallel processing, shortest-path problem.; Arithmetic; Associative memory; Cranes; Labeling; Parallel processing; Tail; Telephony; Index terms—Associative and content-adressable memory, graphs, highly parallel processing, shortest-path problem.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1968.227419
  • Filename
    1687426
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1191282