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
fDate :
5/1/1999 12:00:00 AM
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;
Journal_Title :
Neural Networks, IEEE Transactions on
