Zobrazeno 1 - 7
of 7
pro vyhledávání: '"N. N. Kuzjurin"'
Autor:
D. A. Grushin, N. N. Kuzjurin
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 6, Pp 229-244 (2018)
MPI is a well-proven technology that is widely used in a high-performance computing environment. However, configuring an MPI cluster can be a difficult task. Containers are a new approach to virtualization and simple application packaging, which is b
Externí odkaz:
https://doaj.org/article/130b8a69cc70418c98e512fd23255d23
Autor:
D. O. Lazarev, N. N. Kuzjurin
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 4, Pp 209-230 (2018)
In this survey, online algorithms for such packing problems as Bin Packing, Strip Packing and their generalizations, such as Multidimensional Bin Packing, Multiple Strip Packing and packing into strips of different width were considered. For the latt
Externí odkaz:
https://doaj.org/article/56b4b2229c3447e69665113c6b4ef323
Autor:
N. N. Kuzjurin, A. I. Pospelov
Publikováno v:
Труды Института системного программирования РАН, Vol 19, Iss 0 (2018)
In the article an on-line algorithm for packing rectangles into a strip is presented and studied. The estimation of expected wasted ratio for the algorithm is obtained.
Externí odkaz:
https://doaj.org/article/0f18ce5d7ca4475fb334de645b081ca1
Autor:
N. N. Kuzjurin
Publikováno v:
Journal of Mathematical Sciences. 108:1-48
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83874896671c330354e5ae57148d4ad6
https://doi.org/10.1023/a:1012778715468
https://doi.org/10.1023/a:1012778715468
Autor:
N. N. Kuzjurin
Publikováno v:
Combinatorics, Probability and Computing. 9:265-276
For any fixed l < k we present families of asymptotically good packings and coverings of the l-subsets of an n-element set by k-subsets, and an algorithm that, given a natural number i, finds the ith k-subset of the family in time and space polynomia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50c7f0ebabc7324ee6fbce86e79fb48d
https://doi.org/10.1017/s0963548300004235
https://doi.org/10.1017/s0963548300004235
Autor:
N. N. Kuzjurin
Publikováno v:
Order. 9:205-208
I. Rival and A. Rutkowski conjectured that the ratio of the number of automorphisms of an arbitrary poset to the number of order-preserving maps tends to zero as the size of the poset tends to infinity. We prove this hypothesis for direct products of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a3c2a7405c554cddb2afef0a5b98cf8
https://doi.org/10.1007/bf00383944
https://doi.org/10.1007/bf00383944
Autor:
N N Kuzjurin, Konrad Engel
Publikováno v:
Combinatorica. 5:301-309
LetP be a finite partially ordered set. The lengthl(x) of an elementx ofP is defined by the maximal number of elements, which lie in a chain withx at the top, reduced by one. Letw(P) (d(P)) be the maximal number of elements ofP which have the same le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75703c56db3f9478d5b2d45d97026f3e
https://doi.org/10.1007/bf02579244
https://doi.org/10.1007/bf02579244