Sciweavers

401 search results - page 42 / 81
» Evolving a neural network using dyadic connections
Sort
View
IJON
2002
123views more  IJON 2002»
13 years 7 months ago
N-bit parity neural networks: new solutions based on linear programming
In this paper, the N-bit parity problem is solved with a neural network that allows direct connections between the input layer and the output layer. The activation function used i...
Derong Liu, Myron E. Hohil, Stanley H. Smith
ACSC
2008
IEEE
13 years 9 months ago
An investigation of the state formation and transition limitations for prediction problems in recurrent neural networks
Recurrent neural networks are able to store information about previous as well as current inputs. This "memory" allows them to solve temporal problems such as language r...
Angel Kennedy, Cara MacNish
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
IJCNN
2007
IEEE
14 years 2 months ago
Predicting Spike Activity in Neuronal Cultures
be regarded as an abstraction of the underlying effective network connectivity, i.e. its functional connectivity. Although similar functional connectivity models have been describe...
Tayfun Gürel, Ulrich Egert, Steffen Kandler, ...
IJON
2006
79views more  IJON 2006»
13 years 7 months ago
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...
Wei Wang 0008, Jean-Jacques E. Slotine