Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Luis Miguel Rios"'
Publikováno v:
Computational Optimization and Applications. 85:337-367
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4988ea542364ba373f94da1d47d2f529
https://doi.org/10.1007/s10589-023-00466-3
https://doi.org/10.1007/s10589-023-00466-3
Publikováno v:
ZARCH. :188-199
espanolEl borde urbano en la ciudad de Medellin –centro metropolitano del valle de Aburra– responde a las caracteristicas de ocupacion, desarrollo y expansion de muchas de las ciudades latinoamericanas en las que se han venido generando procesos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3408c1a35a92c609ae37537f2f73fa6
https://doi.org/10.26754/ojs_zarch/zarch.2020144303
https://doi.org/10.26754/ojs_zarch/zarch.2020144303
Autor:
Ana Carolina Freitas Ribeiro, Brígida Mónica Faria, Luís Paulo Reis, Ricardo Gomes, Luis Miguel Rios
Publikováno v:
2017 12th Iberian Conference on Information Systems and Technologies (CISTI).
Knowledge Discovery in Databases (KDD) is a major innovation in knowledge extraction. This knowledge can be extracted to recognize patterns or behaviors. Board games playing patterns are a concise experiment on testing data mining methods in order to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ae285e0ede2e98c29606803beb40e2e
https://doi.org/10.23919/cisti.2017.7976065
https://doi.org/10.23919/cisti.2017.7976065
Publikováno v:
Annals of Operations Research. 177:63-90
Empirical and theoretical studies of preference structures of investors have long shown that personal and corporate utility is typically multimodal, implying that the same investor can be risk-averse at certain levels of wealth while risk-seeking at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59149bb05c195be5af614c284104f663
https://doi.org/10.1007/s10479-009-0592-6
https://doi.org/10.1007/s10479-009-0592-6
Publikováno v:
Journal of Global Optimization. 56(3):1247-1293
This paper addresses the solution of bound-constrained optimization problems using algorithms that require only the availability of objective function values but no derivative information. We refer to these algorithms as derivative-free algorithms. F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bad629a36c7352e1e05d17d066b0ae6a