Finding the shortest path in the shortest time using PCNN's. 1999

H J Caulfield, and J M Kinser
Fisk University, Nashville, TN 37208-3051, USA.

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.

UI MeSH Term Description Entries

Related Publications

H J Caulfield, and J M Kinser
January 2019, NeuroImage. Clinical,
H J Caulfield, and J M Kinser
November 2009, International journal of computer assisted radiology and surgery,
H J Caulfield, and J M Kinser
August 2022, Scientific reports,
H J Caulfield, and J M Kinser
January 2015, F1000Research,
H J Caulfield, and J M Kinser
September 2016, Medical & biological engineering & computing,
H J Caulfield, and J M Kinser
August 2015, Computers in biology and medicine,
H J Caulfield, and J M Kinser
January 2015, Designs, codes, and cryptography,
H J Caulfield, and J M Kinser
June 2017, Neural networks : the official journal of the International Neural Network Society,
H J Caulfield, and J M Kinser
January 2014, TheScientificWorldJournal,
Copied contents to your clipboard!