Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Generic Formulation of Neural Nets as a Model of Parallel and Self-Programming Computation
IWANN '97 Proceedings of the International Work-Conference on Artificial and Natural Neural Networks: Biological and Artificial Computation: From Neuroscience to Technology
EpsiloNN - A Specification Language for the Efficient Parallel Simulation of Neural Networks
IWANN '97 Proceedings of the International Work-Conference on Artificial and Natural Neural Networks: Biological and Artificial Computation: From Neuroscience to Technology
Application of XML for neural network exchange
Computer Standards & Interfaces - XML Diffusion: Transfer and differentiation
Hi-index | 0.00 |
This paper presents the definition of a formal data structure, which assists in the characterization of any neural paradigm, with no restriction, including higher-order networks. Within this model, a neural network is mathematically described by specifying some static parameters (number of neurons, order) as well as a set of statistical distributions (which we call the network ‘dynamics’). Once a concrete set of distributions is defined, a single algorithm can simulate any neural paradigm. The presented structure assists in an exhaustive and precise description of the network characteristics and the simulation parameters, providing us with a unified criterion for comparing models and evaluating proposed systems. Though not presented here, the formal model has inspired a software simulator, which implements any system defined according to this structure, thus facilitating the analysis and modelling of neuronal paradigms.