Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Vadim Romanuke"'
Autor:
Vadim Romanuke
Publikováno v:
Journal of Information and Organizational Sciences, Vol 48, Iss 1, Pp 81-98 (2024)
A finite zero-sum game defined on a subset of the unit square is considered. The game is a generalized progressive discrete silent duel, in which the kernel is skew-symmetric, and the players, referred to as duelists, have identical linear accuracy f
Externí odkaz:
https://doaj.org/article/a0b5ada07ef2420cbc7a0e95c2e06d79
Publikováno v:
Sistemnì Doslìdženâ ta Informacìjnì Tehnologìï, Iss 2, Pp 104-126 (2023)
The problem of minimizing the cost of maritime cargo delivery is considered. The cost is equivalent to the sum of the tour lengths of feeders used for the delivery. The problem is formulated as a multiple traveling salesman problem. In order to find
Externí odkaz:
https://doaj.org/article/07f2ca450f2643229df81c8f442814bd
Autor:
Hanna Yehoshyna, Vadim Romanuke
Publikováno v:
Journal of Communications Software and Systems, Vol 17, Iss 4, Pp 314-320 (2021)
In this paper, we suggest a novel recommender system where a set of appropriate propositions is formed by measuring how user query features are close to space of all possible propositions. The system is for e-traders selling commodities. A commodity
Externí odkaz:
https://doaj.org/article/f5335ad40db749599d7fbdd69745fa94
Autor:
Vadim Romanuke
Publikováno v:
Вісник Харківського національного університету імені В.Н. Каразіна. Серія: Математичне моделювання, інформаційні технології, автоматизовані системи управління, Iss 40 (2018)
For the preemptive scheduling problem in case of subsequent job importance growth, it is studied whether the optimal schedule might be found faster within an exact model. It is ascertained that when the number of jobs up to six (except for the case o
Externí odkaz:
https://doaj.org/article/92ff4604ce394864884449a954ead46d
Autor:
Vadim Romanuke
Publikováno v:
Journal of Information and Organizational Sciences, Vol 38, Iss 2 (2014)
There is suggested a method of approximating unit-hypercubic infinite antagonistic game with the matrix game and the corresponding solution in finite strategies. The method is based on dimension-dependent irregular samplings over the game kernel. Num
Externí odkaz:
https://doaj.org/article/a30533916c154648b2dbd209cf174dfa
Autor:
Vadim Romanuke
Publikováno v:
Annals of the University of Craiova - Mathematics and Computer Science Series. 49:270-290
A method of finite approximation of zero-sum games defined on a product of staircase-function continuous spaces is presented. The method consists in uniformly sampling the player’s pure strategy value set, solving “smaller” matrix games, each d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::053234fc2b705d02f3727d1e35cd409e
https://doi.org/10.52846/ami.v49i2.1554
https://doi.org/10.52846/ami.v49i2.1554
Autor:
Vadim Romanuke
Publikováno v:
Information and Telecommunication Sciences. :62-71
Background. If the intensity of moving targets within a surveyed area is low, an optimal number of uniform rectangular array (URA) radar sensors is in either the minimally-sized URA (or close to it) or maximally-sized URA (or close to it), where the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8a144cbe810dfee162b0178ac328faa
https://doi.org/10.20535/2411-2976.22022.62-71
https://doi.org/10.20535/2411-2976.22022.62-71
Autor:
Vadim Romanuke
Publikováno v:
Applied Computer Systems. 27:89-100
A method is suggested to find all local minima and the global minimum of an unknown two-variable function bounded on a given rectangle regardless of the rectangle area. The method has eight inputs: five inputs defined straightforwardly and three inpu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f0a6e11834f2263969a3fdcfceb1418
https://doi.org/10.2478/acss-2022-0010
https://doi.org/10.2478/acss-2022-0010
Autor:
Vadim Romanuke
Publikováno v:
Applied Computer Systems. 27:1-12
A problem of minimizing the total weighted tardiness in the preemptive single machine scheduling for discrete manufacturing is considered. A hyper-heuristic is presented, which is composed of 24 various heuristics, to find an approximately optimal sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::712ca1f359989a65478ffd0de99fc959
https://doi.org/10.2478/acss-2022-0001
https://doi.org/10.2478/acss-2022-0001
Autor:
Vadim Romanuke
Publikováno v:
Electrical, Control and Communication Engineering. 18:27-36
A numerical method is suggested to find all local minima and the global minimum of an unknown single-variable function bounded on a given interval regardless of the interval length. The method has six inputs: three inputs defined straightforwardly an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::022e590314e28268997707d406b748fe
https://doi.org/10.2478/ecce-2022-0004
https://doi.org/10.2478/ecce-2022-0004