Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Nikolay P. Khrapov"'
Autor:
Nikolay P. Khrapov
Publikováno v:
Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes. 16:62-72
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b65b223b0aa369388268e5a08aaa64be
https://doi.org/10.21638/11701/spbu10.2020.106
https://doi.org/10.21638/11701/spbu10.2020.106
Using virtualization to protect the proprietary material science applications in volunteer computing
Autor:
Valery V. Rozen, Artem I. Samtsevich, Artem R. Oganov, Mikhail Posypkin, Vladimir A. Sukhomlin, Nikolay P. Khrapov
Publikováno v:
Open Engineering, Vol 8, Iss 1, Pp 57-60 (2018)
USPEX is a world-leading software for computational material design. In essence, USPEX splits simulation into a large number of workunits that can be processed independently. This scheme ideally fits the desktop grid architecture. Workunit processing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5661f88cc67f9597afa1dfebcef1d49c
https://doaj.org/article/1b9821cbf66b48d59b8e0a7a1bac0d9a
https://doaj.org/article/1b9821cbf66b48d59b8e0a7a1bac0d9a
Publikováno v:
Open Engineering, Vol 8, Iss 1, Pp 102-108 (2018)
“XANSONS for COD” (http://xansons4cod.com) is a new BOINC project aimed at creating the open-access database of simulated x-ray and neutron powder diffraction patterns for nanocrystalline phase of materials from the collection of the Crystallogra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6eab752744d1954dda9cac15b2105375
https://doaj.org/article/c88211be5162499ebf1ee20c1f79e509
https://doaj.org/article/c88211be5162499ebf1ee20c1f79e509
Publikováno v:
Lobachevskii Journal of Mathematics. 38:926-930
The problem of crystal structure prediction is very old and does, in fact, constitute the central problem of theoretical crystal chemistry. In this paper, we discuss the popular USPEX evolutionary algorithm for crystal structure prediction. Here we p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5df76f1b0422ff48913e1690b2d2252b
https://doi.org/10.1134/s1995080217050195
https://doi.org/10.1134/s1995080217050195
Autor:
Nikolay P. Khrapov, Mikhail Posypkin
Publikováno v:
2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus).
The Branch and Bound method (B&B) is an efficient and well-known technique to solve combinatorial optimization problems. However for real-life problems B&B can consume tremendous amount of resources thereby making reasonable the use of parallel and d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17160ac5ef475d47634d55c4fe1965f1
https://doi.org/10.1109/eiconrus.2017.7910607
https://doi.org/10.1109/eiconrus.2017.7910607