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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
