Sciweavers

79 search results - page 3 / 16
» A Recurrent Neural Network for Solving the Shortest Path Pro...
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 29 days ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
CATA
2004
13 years 8 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
TNN
2010
121views Management» more  TNN 2010»
13 years 2 months ago
Foundations of implementing the competitive layer model by Lotka-Volterra recurrent neural networks
The competitive layer model (CLM) can be described by an optimization problem. The problem can be further formulated by an energy function, called the CLM energy function, in the s...
Zhang Yi
ICANN
2009
Springer
14 years 1 days ago
Scalable Neural Networks for Board Games
Learning to solve small instances of a problem should help in solving large instances. Unfortunately, most neural network architectures do not exhibit this form of scalability. Our...
Tom Schaul, Jürgen Schmidhuber