Automata network and optimization

Eric Goles, Servet Martínez

Research output: Contribution to journalArticlepeer-review


We characterized a class of optimization problems for which the parellel dynamics of positive automata networks is a hill-climbing strategy. Our formalism allows to get directly the equivalence between dual optimization problems generalizing the results obtained by A.J.E.M. Janssen [Inform. Process. Lett. 37 (1991)], where a neural network is related to a constrained optimization problem.

Original languageEnglish
Pages (from-to)339-343
Number of pages5
JournalInformation Processing Letters
Issue number6
StatePublished - 24 Jul 1992
Externally publishedYes


  • Automata networks
  • combinatorial problems
  • distributed computing
  • hill-climbing
  • optimization


Dive into the research topics of 'Automata network and optimization'. Together they form a unique fingerprint.

Cite this