Automata network and optimization

Eric Goles; Servet Martínez

doi:10.1016/0020-0190(92)90233-L

Automata network and optimization

Eric Goles, Servet Martínez

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	English
Pages (from-to)	339-343
Number of pages	5
Journal	Information Processing Letters
Volume	42
Issue number	6
DOIs	https://doi.org/10.1016/0020-0190(92)90233-L
State	Published - 24 Jul 1992
Externally published	Yes

Keywords

Automata networks
combinatorial problems
distributed computing
hill-climbing
optimization

Access to Document

10.1016/0020-0190(92)90233-L

Cite this

@article{874d6257615b4fbdb0b270290bcb73ca,

title = "Automata network and optimization",

abstract = "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.",

keywords = "Automata networks, combinatorial problems, distributed computing, hill-climbing, optimization",

author = "Eric Goles and Servet Mart{\'i}nez",

note = "Funding Information: This work was partiallys upportedb y FONDE-CYT, under grants 1208-91(S M), 1211-91(E G), and by DTI, Universidad de Chile. We are also indebted to an anonymousr eferee for his valuable commentsa nd suggestions.",

year = "1992",

month = jul,

day = "24",

doi = "10.1016/0020-0190(92)90233-L",

language = "English",

volume = "42",

pages = "339--343",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Automata network and optimization

AU - Goles, Eric

AU - Martínez, Servet

N1 - Funding Information: This work was partiallys upportedb y FONDE-CYT, under grants 1208-91(S M), 1211-91(E G), and by DTI, Universidad de Chile. We are also indebted to an anonymousr eferee for his valuable commentsa nd suggestions.

PY - 1992/7/24

Y1 - 1992/7/24

N2 - 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.

AB - 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.

KW - Automata networks

KW - combinatorial problems

KW - distributed computing

KW - hill-climbing

KW - optimization

UR - http://www.scopus.com/inward/record.url?scp=0026895416&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(92)90233-L

DO - 10.1016/0020-0190(92)90233-L

M3 - Article

AN - SCOPUS:0026895416

SN - 0020-0190

VL - 42

SP - 339

EP - 343

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

Automata network and optimization

Abstract

Keywords

Access to Document

Fingerprint

Cite this