• DocumentCode
    1503177
  • Title

    Finding the shortest path in the shortest time using PCNN´s

  • Author

    Caulfield, H. John ; Kinser, Jason M.

  • Author_Institution
    Fisk Univ., Nashville, TN, USA
  • Volume
    10
  • Issue
    3
  • fYear
    1999
  • fDate
    5/1/1999 12:00:00 AM
  • Firstpage
    604
  • Lastpage
    606
  • Abstract
    A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time
  • Keywords
    computational complexity; graph theory; minimisation; neural nets; PCNN; mazes; pulse coupled neural network; shortest path finding; Bioinformatics; Biotechnology; Helium; Inspection; Intelligent networks; Missiles; Neural networks; Neurons; Pixel; Steady-state;
  • fLanguage
    English
  • Journal_Title
    Neural Networks, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9227
  • Type

    jour

  • DOI
    10.1109/72.761718
  • Filename
    761718
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1503177