Zobrazeno 1 - 10
of 116
pro vyhledávání: '"Alexander A. Kononov"'
Autor:
Olga V. Bazhanova, Alexander A. Kononov, Ksenia V. Smuseva, Vladislav A. Stepkin, Grigory K. Uskov
Publikováno v:
Физика волновых процессов и радиотехнические системы, Vol 26, Iss 4, Pp 78-87 (2024)
Background. Antenna arrays are widely used in various fields of radio engineering, such as radio and telecommunications, satellite communication systems, etc. One of the important characteristics of an antenna array is its radiation pattern. The esti
Externí odkaz:
https://doaj.org/article/2d2f7c8ec0db4f3293461f07151fe9d6
Autor:
Roman I. Bubyakin, Svetlana V. Kononova, Olga P. Byadovskaya, Dmitriy A. Biryuchenkov, Alexander V. Kononov
Publikováno v:
Труды Федерального центра охраны здоровья животных. 18:99-121
Autor:
Yulia Zakharova, Alexander V. Kononov
Publikováno v:
Journal of Global Optimization. 83:539-564
We are given a set of parallel jobs that have to be executed on a set of speed-scalable processors varying their speeds dynamically. Running a job at a slower speed is more energy-efficient, however, it takes a longer time and affects the performance
Autor:
Alexander A. Potapov, Alexander A. Kononov, Anatoly M. Bobreshov, Kseniya V. Smuseva, Grigory K. Uskov
Publikováno v:
2022 IEEE Conference on Antenna Measurements and Applications (CAMA).
Publikováno v:
2022 IEEE 8th All-Russian Microwave Conference (RMC).
Publikováno v:
Journal of Global Optimization. 83:445-456
The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the end of its second operation. The storage requirement of a job is deter
Publikováno v:
Optimization Letters. 15:2433-2454
The publications on two-machine flow shop scheduling problems with job dependent storage requirements, where a job seizes a portion of the storage space for the entire duration of its processing, were motivated by various applications ranging from su
Publikováno v:
Theoretical Computer Science. 793:70-78
Bi-criteria lexicographical minimization problems with the makespan as the primary objective and the total machine assignment costs as the secondary objective have been recently introduced to the scheduling research, and polynomial time ( r + 1 , 1 )
Autor:
Konstantinos Dogeas, Fanny Pascual, Giorgio Lucarelli, Evripidis Bampis, Alexander V. Kononov
Publikováno v:
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures
33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021)
33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), ACM, Jul 2021, virtual conference, United States. pp.83-93, ⟨10.1145/3409964.3461812⟩
SPAA
33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021)
33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021), ACM, Jul 2021, virtual conference, United States. pp.83-93, ⟨10.1145/3409964.3461812⟩
SPAA
International audience; In this paper, we introduce a model for the speed scaling setting in the framework of explorable uncertainty. In the model, each job has a release time, a deadline and an unknown workload that can be revealed to the algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::418f2a53a189b9010f38f2db58d22ae5
https://hal.archives-ouvertes.fr/hal-03389776/document
https://hal.archives-ouvertes.fr/hal-03389776/document
Publikováno v:
Sibirskie Elektronnye Matematicheskie Izvestiya. 16:249-257
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor