You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/8907
Full metadata record
DC FieldValueLanguage
dc.contributor.authorda Silva, I. N.-
dc.contributor.authorUlson, Jose Alfredo Covolan-
dc.contributor.authorde Souza, A. N.-
dc.date.accessioned2014-05-20T13:27:14Z-
dc.date.available2014-05-20T13:27:14Z-
dc.date.issued2004-01-01-
dc.identifierhttp://dx.doi.org/10.1007/978-3-540-24844-6_148-
dc.identifier.citationArtificial Intelligence and Soft Computing - Icaisc 2004. Berlin: Springer-verlag Berlin, v. 3070, p. 954-959, 2004.-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/11449/8907-
dc.description.abstractThis paper presents an efficient neural network for solving constrained nonlinear optimization problems. More specifically, a two-stage neural network architecture is developed and its internal parameters are computed using the valid-subspace technique. The main advantage of the developed network is that it treats optimization and constraint terms in different stages with no interference with each other. Moreover, the proposed approach does not require specification of penalty or weighting parameters for its initialization.en
dc.format.extent954-959-
dc.language.isoeng-
dc.publisherSpringer-
dc.sourceWeb of Science-
dc.titleImplementation of two-stage Hopfield model and its application in nonlinear systemsen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationUNESP, FE, Sch Engn, Dept Elect Engn, BR-17033360 Bauru, SP, Brazil-
dc.description.affiliationUnespUNESP, FE, Sch Engn, Dept Elect Engn, BR-17033360 Bauru, SP, Brazil-
dc.identifier.doi10.1007/978-3-540-24844-6_148-
dc.identifier.wosWOS:000222325200148-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofArtificial Intelligence and Soft Computing - Icaisc 2004-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.