Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Julius Ilinskas"'
Publikováno v:
Computers & Operations Research. 79:12-18
We consider discrete location problems for an entering firm which competes with other established firms in a market where customers are spatially separated. In these problems, a given number of facility locations must be selected among a finite set o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::944a8301116b9381ee199adeb1922c86
https://doi.org/10.1016/j.cor.2016.10.002
https://doi.org/10.1016/j.cor.2016.10.002
Autor:
Julius Ilinskas, Aleksandr Igumenov
Publikováno v:
3PGCIC
The object of research of the article is environment-friendly technologies that can minimize electrical energy consumption of parallel and distributed computers. The study revealed that even without computations computer clusters consume considerable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::427be8ddc44c6cdb753fa74c022ea1d1
https://doi.org/10.1109/3pgcic.2013.91
https://doi.org/10.1109/3pgcic.2013.91
Autor:
Julius Ilinskas
Publikováno v:
3PGCIC
The speed of communications is not uniform in multilevel high-performance computers and multicore clusters. Therefore the communication performance depends on the location of parallel processes within the system. The communication pattern of a parall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd9e611ae150b4bcba0867101136b945
https://doi.org/10.1109/3pgcic.2013.92
https://doi.org/10.1109/3pgcic.2013.92
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:
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
