79 search results - page 7 / 16 » A Recurrent Neural Network for Solving the Shortest Path Pro... |
MFCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
JCM
2007
13 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— A solution for the slow convergence of most learning rules for Recurrent Neural Networks (RNN) has been proposed under the terms Liquid State Machines (LSM) and Echo State Netw...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
PAMI
2010
13 years 5 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...