Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/37703
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dorea, CCY | - |
dc.contributor.author | Goncalves, C. R. | - |
dc.date.accessioned | 2014-05-20T15:27:46Z | - |
dc.date.accessioned | 2016-10-25T18:02:41Z | - |
dc.date.available | 2014-05-20T15:27:46Z | - |
dc.date.available | 2016-10-25T18:02:41Z | - |
dc.date.issued | 1993-08-01 | - |
dc.identifier | http://dx.doi.org/10.1007/BF00939677 | - |
dc.identifier.citation | Journal of Optimization Theory and Applications. New York: Plenum Publ Corp, v. 78, n. 2, p. 401-407, 1993. | - |
dc.identifier.issn | 0022-3239 | - |
dc.identifier.uri | http://hdl.handle.net/11449/37703 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/37703 | - |
dc.description.abstract | Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point. | en |
dc.format.extent | 401-407 | - |
dc.language.iso | eng | - |
dc.publisher | Plenum Publ Corp | - |
dc.source | Web of Science | - |
dc.subject | RANDOM OPTIMIZATION | pt |
dc.subject | SAMPLING STRATEGY | pt |
dc.subject | EXPECTED LENGTH | pt |
dc.title | ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM | en |
dc.type | outro | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | UNIV ESTADUAL PAULISTA,DEPT MATEMAT,SAO PAULO,BRAZIL | - |
dc.description.affiliationUnesp | UNIV ESTADUAL PAULISTA,DEPT MATEMAT,SAO PAULO,BRAZIL | - |
dc.identifier.doi | 10.1007/BF00939677 | - |
dc.identifier.wos | WOS:A1993LZ35000011 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Journal of Optimization Theory and Applications | - |
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.