Name
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 |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/72.761718 | IEEE Transactions on Neural Networks |
Keywords | Field | DocType |
minimisation,steady state,biotechnology,neural networks,intelligent networks,pixel,indexing terms,graph theory,bioinformatics,computational complexity,neural nets,inspection,helium,shortest path | Pathfinding,Average path length,Shortest path problem,Computer science,Algorithm,Constrained Shortest Path First,Optical neural network,Yen's algorithm,Artificial intelligence,Shortest Path Faster Algorithm,Machine learning,K shortest path routing | Journal |
Volume | Issue | ISSN |
10 | 3 | 1045-9227 |
Citations | PageRank | References |
37 | 2.22 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. John Caulfield | 1 | 443 | 164.79 |
| Jason M. Kinser | 2 | 60 | 7.71 |