Sciweavers

198 search results - page 16 / 40
» Weighted Dynamic Pushdown Networks
Sort
View
BC
2007
79views more  BC 2007»
13 years 7 months ago
Spike-timing-dependent plasticity for neurons with recurrent connections
The dynamics of the learning equation, which describes the evolution of the synaptic weights, is derived in the situation where the network contains recurrent connections. The deri...
Anthony N. Burkitt, Matthieu Gilson, J. Leo van He...
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 1 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
ISNN
2007
Springer
14 years 1 months ago
Neural Networks Training with Optimal Bounded Ellipsoid Algorithm
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
José de Jesús Rubio, Wen Yu
ICGA
1993
145views Optimization» more  ICGA 1993»
13 years 8 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
ML
1998
ACM
136views Machine Learning» more  ML 1998»
13 years 7 months ago
Co-Evolution in the Successful Learning of Backgammon Strategy
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
Jordan B. Pollack, Alan D. Blair