Sciweavers

79 search results - page 4 / 16
» A Recurrent Neural Network for Solving the Shortest Path Pro...
Sort
View
TNN
2008
88views more  TNN 2008»
13 years 7 months ago
A New Approach to Knowledge-Based Design of Recurrent Neural Networks
Abstract-- A major drawback of artificial neural networks (ANNs) is their black-box character. This is especially true for recurrent neural networks (RNNs) because of their intrica...
Eyal Kolman, Michael Margaliot
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 7 months ago
May We Have Your Attention: Analysis of a Selective Attention Task
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
Eldan Goldenberg, Jacob R. Garcowski, Randall D. B...
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
14 years 27 days ago
Breeding swarms: a new approach to recurrent neural network training
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...
Matthew Settles, Paul Nathan, Terence Soule
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
4OR
2010
148views more  4OR 2010»
13 years 5 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini