Zobrazeno 1 - 10
of 12
pro vyhledávání: '"F. R. Herrera"'
Publikováno v:
TOP, 22(1), 254-273
TOP 22 (2014) 1
TOP 22 (2014) 1
The mixture design problem for two products concerns finding simultaneously two recipes of a blending problem with linear, quadratic and semi-continuity constraints. A solution of the blending problem minimizes a linear cost objective and an integer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::784d07f7fcc43c610877c2fd8059c9c4
https://doi.org/10.1007/s11750-012-0253-9
https://doi.org/10.1007/s11750-012-0253-9
Publikováno v:
Computational Science and Its Applications--ICCSA 2015 ISBN: 9783319214061
ICCSA (2)
ICCSA (2)
Simplicial partitions are suitable to divide a bounded area in branch and bound. In the iterative refinement process, a popular strategy is to divide simplices by their longest edge, thus avoiding needle-shaped simplices. A range of possibilities ari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fe10fd7247efd62ddec8f052b03db12
https://doi.org/10.1007/978-3-319-21407-8_32
https://doi.org/10.1007/978-3-319-21407-8_32
Publikováno v:
Computational Science ans Its Applications-ICCSA 2014, Part II. Cham: Springer
Computational Science ans Its Applications-ICCSA 2014, Part II
Computational Science and Its Applications – ICCSA 2014 ISBN: 9783319091280
ICCSA (2)
Computational Science ans Its Applications-ICCSA 2014, Part II
Computational Science and Its Applications – ICCSA 2014 ISBN: 9783319091280
ICCSA (2)
Simplicial subsets are popular in branch-and-bound methods for Global Optimization. Longest Edge Bisection is a convenient way to divide a simplex. When the number of dimensions is greater than two, irregular simplices (not all edges have the same le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad7cc588beb8bc5535a5d79b9dc16cf4
https://doi.org/10.1007/978-3-319-09129-7_8
https://doi.org/10.1007/978-3-319-09129-7_8
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319143248
Euro-Par Workshops (1)
Euro-Par 2014 Workshops part 1. Springer International Publishing
Euro-Par 2014 Workshops part 1
Euro-Par Workshops (1)
Euro-Par 2014 Workshops part 1. Springer International Publishing
Euro-Par 2014 Workshops part 1
Traffic lights can be controlled dynamically through rules reacting on the number of waiting vehicles at each light. A rule can be captured by a so-called Traffic Control Table (TCT). The Value Iteration method from Stochastic Dynamic Programming has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e7a0ebbbbcdb24c157a893767d3c031
https://doi.org/10.1007/978-3-319-14325-5_6
https://doi.org/10.1007/978-3-319-14325-5_6
Publikováno v:
3PGCIC
Recently it was shown, that proposed simplicial partition based DISIMPL algorithm gives very competitive results to well known DIRECT algorithm for standard test functions and performs particularly well when the search space and the numbers of local
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04f51270c9f8f332bdb653399a6c952a
https://doi.org/10.1109/3pgcic.2013.90
https://doi.org/10.1109/3pgcic.2013.90
Autor:
Juan F. R. Herrera, Eligius M. T. Hendrix, Leocadio G. Casado, Julius Zilinskas, Remigijus Paulavičius
Publikováno v:
IPDPS Workshops
We investigate models that efficiently map branch-and-bound algorithms on a distributed computer architecture using a case of multidimensional Lipschitz Global Optimization. A combination of MPI and Pthreads is studied: MPI for distributed computatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::715f0357ee06b6703d90266bd22755b3
https://doi.org/10.1109/ipdpsw.2013.178
https://doi.org/10.1109/ipdpsw.2013.178
Autor:
Remigijus Paulavičius, Eligius M. T. Hendrix, Julius Ilinskas, Leocadio G. Casado, Juan F. R. Herrera
Publikováno v:
3PGCIC
Most Lipschitzian Global Optimization algorithms perform an exhaustive search using a branch-and-bound (B&B) scheme. The question is how to run multi-dimensional Lipschitz Global Optimization in parallel, such that the implementation depending on the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b72ba67cb672331b5d6e866aa8f3a3d
Autor:
Zoraya Rodríguez, Madeleidy Martínez, L. Sarmiento, Mayriulis Pérez, L.E. Dihigo, Odalys Núñez, F. R. Herrera, Yasmila Hernández
Publikováno v:
Universidad Autónoma de Yucatán
UAY
Redalyc-UAY
UAY
Redalyc-UAY
Para determinar el efecto de la inclusión de harina de forraje de Mucuna deeringiana en algunos grupos fisiológicos microbianos e indicadores fermentativos cecales de pollos de ceba, se realizó un experimento según diseño completamente aleatoriz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3056::b471686f9c86c45ae88e606912f36e9a
http://www.redalyc.org/articulo.oa?id=193024447013
http://www.redalyc.org/articulo.oa?id=193024447013
Publikováno v:
ChemInform. 27
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40a8d06d1ba9874af248394beb1bfd99
https://doi.org/10.1002/chin.199629132
https://doi.org/10.1002/chin.199629132
Publikováno v:
TOP. 22:419-420
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf0792cb601a201f5ee92982cab27fe3
https://doi.org/10.1007/s11750-012-0258-4
https://doi.org/10.1007/s11750-012-0258-4