Benchmarking a recurrent neural network based efficient shortest path problem (SPP) solver concept under difficult dynamic parameter settings conditions
- 1 July 2016
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 196, 175-209
Abstract
No abstract availableKeywords
This publication has 50 references indexed in Scilit:
- Fast extraction of minimal paths in 3D images and applications to virtual endoscopyMedical Image Analysis, 2001
- De-interlacing of video images using a shortest path techniqueIEEE Transactions on Consumer Electronics, 2001
- A dual neural network for kinematic control of redundant robot manipulatorsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2001
- The (Dantzig) simplex method for linear programmingComputing in Science & Engineering, 2000
- Experimental analysis of dynamic algorithms for the single source shortest paths problemACM Journal of Experimental Algorithmics, 1998
- Evolutionary programming techniques for constrained optimization problemsIEEE Transactions on Evolutionary Computation, 1997
- Primal and dual assignment networksIEEE Transactions on Neural Networks, 1997
- Semi-dynamic shortest paths and breadth-first search in digraphs1997
- Neural networks for shortest path computation and routing in computer networksIEEE Transactions on Neural Networks, 1993
- A note on two problems in connexion with graphsNumerische Mathematik, 1959