A discrete adaptive stochastic neural model for constrained optimization

Authors:
Giuliano Grossi
Affiliations:
Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Milano, Italy
Venue:
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part I
Year:
2006

Citing 6
Cited 2

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Introduction to the theory of neural computation

Introduction to the theory of neural computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Distributed Algorithm for Max Independent Set Problem Based on Hopfield Networks

WIRN VIETRI 2002 Proceedings of the 13th Italian Workshop on Neural Nets-Revised Papers
Pseudo-boolean optimization

Discrete Applied Mathematics

Robust stability of discrete-time stochastic neural networks with time-varying delays

Neurocomputing
FPGA implementation of an adaptive stochastic neural model

ICANN'07 Proceedings of the 17th international conference on Artificial neural networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ability to map and solve combinatorial optimization problems with constraints on neural networks has frequently motivated a proposal for using such a model of computation. We introduce a new stochastic neural model, working out for a specific class of constraints, which is able to choose adaptively its weights in order to find solutions into a proper subspace (feasible region) of the search space. We show its asymptotic convergence properties and give evidence of its ability to find hight quality solution on benchmark and randomly generated instances of a specific problem.