|
|||||
|
|
Finding the shortest path in the shortest time using PCNN's |
|
| Authors: | Caulfield H.J. Kinser J.M. |
| Affiliation: | Fisk Univ., Nashville, TN. |
| 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: | |