Zobrazeno 1 - 6
of 6
pro vyhledávání: '"M. P. Revotjuk"'
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 18, Iss 5, Pp 53-61 (2020)
The purpose of the work is to develop models and algorithms for optimizing matching in dynamically generated graphs of asymmetric relations in coordinated open systems of interacting agents with centralized and collective control. The dynamic asymmet
Externí odkaz:
https://doaj.org/article/15c08873f9c1419ab2139e50d189224f
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 18, Iss 5, Pp 71-79 (2020)
The purpose of the work is the development of basic data structures, speed-efficient and memoryefficient algorithms for tracking changes in predefined decisions about sets of shortest paths on transport networks, notifications about which are receive
Externí odkaz:
https://doaj.org/article/1792bddc335946948a50dba3dcfd7212
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 5, Pp 30-36 (2019)
An efficient algorithm for evaluating the interval of solutions stability of opened and closed linear assignment problems based on a review of the results of optimization iterations is proposed. Economical one-step transition to the nearest vertex of
Externí odkaz:
https://doaj.org/article/433be06504b341ce8ff39af51e398a1b
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 4, Pp 73-79 (2019)
On the classical problem of searching the shortest paths in graphs considered the possibility of accelerating the search procedure by incorporating a priori information about the search space. Global initialization of state variables predefined searc
Externí odkaz:
https://doaj.org/article/5a7038f91e4a4767a7b428630f014758
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 7, Pp 25-31 (2019)
The problem of the solution of asymmetric traveling salesman problem with sparse matrix, based on branch and bound techniques with linear assignment problems relaxation, is considered. Inheritance of the result’s data of previous problems and its r
Externí odkaz:
https://doaj.org/article/e4dba45b87e04da3a2cdb9bddbd22ade
Autor:
A. M. Polonevitch, M. P. Revotjuk
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 0, Iss 7, Pp 45-50 (2019)
Real time localization of a moving or stationary object in a video stream is one of the most complex tasks in video processing due to changing background conditions or full / partial object overlaps is considered. For present moment, a number of tech
Externí odkaz:
https://doaj.org/article/553358a7936c4a10bf4b69a0d280f468