Zobrazeno 1 - 10
of 22
pro vyhledávání: '"V. V. Kureichik"'
Publikováno v:
IZVESTIYA SFedU. ENGINEERING SCIENCES. :15-29
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ba6c67c4297dfb1bc678b72d3182c4f
https://doi.org/10.18522/2311-3103-2022-4-15-29
https://doi.org/10.18522/2311-3103-2022-4-15-29
Autor:
V. V. Kureichik, S. I. Rodzin
Publikováno v:
Vestnik komp'iuternykh i informatsionnykh tekhnologii. :12-20
A metaheuristic optimizer is proposed that simulates patterns of behavior of a spider colony for solving optimization problems of multidimensional multiextremal functions. The optimizer allows not only to simulate various types of agent behavior, but
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f247d76abc5771215fd18b4965aacbf
https://doi.org/10.14489/vkit.2022.06.pp.012-020
https://doi.org/10.14489/vkit.2022.06.pp.012-020
Publikováno v:
IZVESTIYA SFedU. ENGINEERING SCIENCES. :189-199
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d84f3d0df272ba9f3a59ef87f20162ac
https://doi.org/10.18522/2311-3103-2022-2-189-199
https://doi.org/10.18522/2311-3103-2022-2-189-199
Autor:
V. V. Kureichik, V.V. Kureichik, Gazprom subterranean repair Urengoy Llc, Saint-Petersburg, Russian Federation
Publikováno v:
INFORMACIONNYE TEHNOLOGII. 26:667-672
The article considers one of the most important combinatorial optimization problems — the problem of graph partitioning. It belongs to the class of NP-complex optimization problems. The article presents the partitioning problem statement. Due to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f5001ec259208d8ed844081fc9788d5
https://doi.org/10.17587/it.26.667-672
https://doi.org/10.17587/it.26.667-672
Publikováno v:
IZVESTIYA SFedU. ENGINEERING SCIENCES. :156-172
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79314ea785f206f2d2f7406a5913bf84
https://doi.org/10.18522/2311-3103-2020-3-156-172
https://doi.org/10.18522/2311-3103-2020-3-156-172
Publikováno v:
IZVESTIYA SFedU. ENGINEERING SCIENCES. :79-88
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::136fc80d75be99bf874b7153e3a0fa3b
https://doi.org/10.18522/2311-3103-2020-2-79-88
https://doi.org/10.18522/2311-3103-2020-2-79-88
Publikováno v:
INFORMACIONNYE TEHNOLOGII. 25:397-404
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bd029444adf9d46e7eddd8c69e2e834
https://doi.org/10.17587/it.25.397-404
https://doi.org/10.17587/it.25.397-404
Publikováno v:
INFORMACIONNYE TEHNOLOGII. 24:239-244
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85c64d03537d9eca09c23795f4cf93de
https://doi.org/10.17587/it.24.239-244
https://doi.org/10.17587/it.24.239-244
Publikováno v:
Vestnik of Ryazan State Radio Engineering University. 62:64-70
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7774b51fa51b053df58e2e1fdabebc95
https://doi.org/10.21667/1995-4565-2017-62-4-64-70
https://doi.org/10.21667/1995-4565-2017-62-4-64-70
Autor:
V. V. Kureichik, A. E. Saak
Publikováno v:
Journal of Physics: Conference Series. 1333:032071
To serve parallel tasks of multiple users of Grid systems require the development of efficient methods for allocating processors and time resources. Optimal resource management is practically unrealizable due to the exponential complexity. In the sit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a0c6a0c1333907ad685301cb63689d7
https://doi.org/10.1088/1742-6596/1333/3/032071
https://doi.org/10.1088/1742-6596/1333/3/032071