Dynamical neural schema for quadratic discrete optimizations problems

E. Goles, G. Hernandez, M. Matamala

Producción científica: Contribución a una revistaArtículo de la conferenciarevisión exhaustiva

2 Citas (Scopus)

Resumen

We present a Dynamical Neural Schema (DNS) that gives very good approximation at global minimum of discrete quadratic problem (P). We test DNS with classical schema and for fixed sigmoid functions. For the computational experiments we take 20×20 symmetric matrices, where we known the global minimum on {0,1}n, and also 40×40 random symmetric matrices. In almost all the cases DNS is better. Experimental comparisons will be given and also theoretical results concerning relations between fixed points of DNS and global optimum at problem (P).

Idioma originalInglés
Páginas (desde-hasta)96
Número de páginas1
PublicaciónNeural Networks
Volumen1
N.º1 SUPPL
DOI
EstadoPublicada - 1988
Publicado de forma externa
EventoInternational Neural Network Society 1988 First Annual Meeting - Boston, MA, USA
Duración: 6 sep. 198810 sep. 1988

Huella

Profundice en los temas de investigación de 'Dynamical neural schema for quadratic discrete optimizations problems'. En conjunto forman una huella única.

Citar esto