Paper
6 April 1995 Pulsed recursive neural networks and resource allocation, part 1: static allocation
Laurent Herault
Author Affiliations +
Abstract
This paper presents a new recursive neural network to solve optimization problems. It is made of binary neutrons with feedbacks. From a random initial state, the dynamics alternate successively several pulsation and constraint satisfaction phases. Applying the previous neural network has the following advantages: (1) There is no need to precisely adjust some parameters in the motion equations to obtain good feasible solutions. (2) During each constraint satisfaction phase, the network converges to a feasible solution. (3) The convergence time in the constraint satisfaction phases is very fast: only a few updates of each neuron are necessary. (4) The end user can limit the global response time of the network which regularly provides feasible solutions. This paper describes such a neural network to solve a complex real time resource allocation problem and compare the performances to a simulated annealing algorithm.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Laurent Herault "Pulsed recursive neural networks and resource allocation, part 1: static allocation", Proc. SPIE 2492, Applications and Science of Artificial Neural Networks, (6 April 1995); https://doi.org/10.1117/12.205132
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Neurons

Neural networks

Binary data

Algorithms

Matrices

Zirconium

Astatine

Back to Top