?
Полудуплексная коммуникационная сложность с противником может быть меньше классической коммуникационной сложности
Математический сборник. 2025. Т. 216. № 6. С. 3–45.
Vereshchagin N., Дектярев М. В.
Keywords: communication complexityкоммуникационная сложностьHalf-duplex communication complexityполудуплексная коммуникационная сложность
Publication based on the results of:
No Species Is an Island, Entire of Itself: Genetic Speciation Algorithm with Interplay among Species
International Journal of Engineering, Transactions B: Applications 2027 Vol. 40 No. 5 P. 1437–1460
This paper, with a particular emphasis on Genetic Algorithm (GA), proposes a novel approach that integrates clustering mechanisms, predator-prey dynamics, and a distinctive selection strategy for generating subsequent populations. The proposed evolutionary algorithm, referred to as Genetic Speciation Algorithm with Interplay Among Species (GSAIS), is comprehensively evaluated against several variants of GAs as well as ...
Added: October 12, 2026
Alexandrov D., Vasilevsky V., Rezunik L. et al., Труды Института системного программирования РАН 2026 Т. 38 № 5 С. 73–90
Large language models demonstrate limitations in tasks that require precise information retrieval from very long input sequences. This limitation affects code generation in large object-oriented systems, where correctness depends on complex inter-class dependencies and the analysis of long execution traces that exceed standard context window sizes. This paper presents JavaCapsule, a technology for automated generation ...
Added: October 12, 2026
Singapore: Springer Singapore, 2026.
This volume presents the Proceedings of the 34th IUPAP Conference on Computational Physics (CCP2023), held in Kobe, Japan on August 4–8, 2023. It offers a collection of peer-reviewed articles that highlight recent developments in computational and simulation research across various areas of physics. Key topics include the use of data science, quantum computing, and machine ...
Added: October 12, 2026
Zykov S. V., Ермаков С. Р., Современные наукоемкие технологии 2026 № 9 С. 43–53
При федеративном обучении с неоднородными клиентскими данными и переменными задержками запоздавшие обновления могут ухудшать качество модели, а обмен параметрами с глобальным сервером увеличивает сетевую нагрузку. Целью исследования является разработка и теоретико-экспериментальное обоснование метода и алгоритмов адаптивного федеративного обучения с учетом распределенного запаздывания клиентских обновлений. Для обоснования разрабатываемых решений использованы событийная и непрерывная модели градиентных обновлений, ...
Added: October 11, 2026
Брычков М. Е., Незнанов А.А., Программирование 2026 № 4 С. 50–66
The matrix profile (MP) quickly became one of the most important time series preprocessing methods when it was introduced in 2016, facilitating the solution of a wide range of time series analysis problems, in particular anomaly and pattern detection problems. The high significance has led to the emergence of various tools for MP calculating, but ...
Added: October 9, 2026
Aleskerov F. T., Вайншток А. П., Делахова А. М. et al., Информационные процессы 2026 Т. 26 № 3 С. 895–913
The development and effective management of territorial entities are priority issues for all states, particularly in the context of the digital transformation of public administration. Over the past decade, the integration of information technologies into municipal and regional planning has significantly altered approaches to strategic development, service delivery, and public engagement. This paper describes the ...
Added: October 9, 2026
Stepanyants V., Andrey V. Fizulin, Chibirov A. et al., FUTURE TRANSPORTATION 2026 Vol. 6 No. 5 Article 225
Reliable Vehicle-to-Everything (V2X) evaluation requires propagation models that represent terrain and multilevel infrastructure. Most integrated vehicular simulators still rely on planar models, but the magnitude of the resulting bias is unclear. This study quantitatively compares flattened two-dimensional (2D) and terrain-aware three-dimensional (3D) variants of three scenarios using identical Sionna RT settings. The pipeline combines OpenStreetMap ...
Added: October 8, 2026
Люксембург А. А., УРСС, 2005.
Изучается возможность автоматизированного построения математических теорий. Рассматривается дедуктивная система, основанная на языке логики предикатов первого порядка, объектами системы являются математические выражения или формулы, которые описывают математические объекты или их свойства. В дедуктивной системе выводятся математические определения и теоремы. Для доказательства теорем используются методы автоматического доказательства. Разработан алгоритм, выводящий часть формул системы. Для решения задачи используется аппарат математической ...
Added: October 7, 2026
Groshev Maksim, Rybakov Petr, Teterin N. et al., Sensors 2026 Article 6171
Manual assessment of soybean yield components, such as pod number, is laborious, time-consuming, and subjective. Existing computer-vision approaches based on object detection or instance segmentation perform poorly on close-range RGB imagery of soybean canopies due to severe occlusions, ambiguous plant boundaries, and the high cost of bounding-box annotation. To address these challenges, we propose a ...
Added: October 7, 2026
Aleskerov F. T., Chaika E., Дерендяев А. Б. et al., Procedia Computer Science 2026 No. 287 P. 590–595
Under conditions of dynamic socio-economic changes, effective planning and decision-making are key factors in ensuring a high quality of life for the population in territories. This paper presents a decision support system for territorial administrations for the development and implementation of sustainable development strategies, using one of the regions of the Russian Federation – the ...
Added: October 7, 2026
Томск: Издательство Томского государственного университета, 2026.
Материалы сборника Шестнадцатой Международной конференции «Новые информационные
технологии в исследовании сложных структур» (Москва, 21–25 сентября 2026 г.) ориентированы на
широкий круг специалистов, работающих на стыке теории информации, системного анализа и
прикладных предметных областей. В издание вошли результаты исследований, посвящённые
моделированию дискретных и стохастических структур управления и связи, разработке
высокопроизводительных вычислительных и телекоммуникационных систем, а также вопросам
цифровой трансформации образования, архитектурно-градостроительного проектирования,
экологического ...
Added: October 6, 2026
Серебренников Д. А., Belov A. V., Информационные технологии и вычислительные системы 2026 № 3 С. 157–169
В условиях роста стоимости энергоресурсов и необходимости повышения энергоэффективности производственных процессов особую актуальность приобретает задача оптимизации энергопотребления промышленных предприятий. В данной работе рассматривается подход к управлению энергозатратами машиностроительного предприятия на основе методов многокритериальной оптимизации. Постановка задачи включает несколько целевых функций: минимизацию энергопотребления, минимизацию стоимости электроэнергии с учётом тарифных ограничений и максимизацию производственной эффективности. Для решения ...
Added: October 5, 2026
Kuninets A., IEEE Transactions on Information Theory 2026 P. 1–1
In this work we study the applicability of Quasi-Cyclic Subfield Subcodes of Dual Elliptic (QC-SSDE) codes for integration into code-based cryptographic schemes. Detailed algorithms are provided for constructing parity-check matrices as well as block-circulant parity-check matrices for this family of codes, accompanied by empirical results that enable the construction of QC-SSDE codes with predetermined dimensions. ...
Added: October 3, 2026
Zykov S. V., Уфимцев Г. А., Моделирование, оптимизация и информационные технологии 2026 Т. 14 № 8 С. 1–13
Информационные системы формируют большие объёмы событийных журналов, которые используются для анализа работы приложений и сервисов. При этом события могут поступать в аналитический контур позже момента их фактического возникновения и не в исходном порядке. Такая рассинхронизация приводит к ошибкам при построении агрегированных временных показателей, а регулярный полный пересчёт многомерного аналитического куба требует значительных вычислительных затрат. Целью ...
Added: October 2, 2026
Polarization of opinions in the group: a modeling algorithm considering the dynamics of social bonds
Chebotarev V., Andreyuk D., Elizarova Anastasiya et al., Procedia Computer Science 2022 Vol. 213 No. C P. 596–601
The dynamics of opinion in a group are of interest for a number of practical purposes. In particular, consensus helps and polarization of opinions hinders cohesive teamwork. Existing approaches for modeling opinion dynamics mostly do not take into account the dynamism of social relations in a group. This paper proposes an algorithm and a program ...
Added: October 2, 2026
Konstantinov A., Elizarova Anastasiya P., Utkin L., Computing, Telecommunications and Control 2026 Vol. 19 No. 1 P. 16–25
Decision trees and their ensemble extensions, such as random forests, are widely used as classification models due to their simplicity and interpretability. However, in many real-world tasks where class labels overlap in the feature space, standard decision trees rely on hard splits that create fragile decision boundaries. In these regions, small perturbations in the input ...
Added: October 2, 2026
Prokhorov A., Burda M., Journal of Computational and Graphical Statistics 2026 P. 1–13
Bayesian nonparametric density estimation procedures are typically based on single-scale priors, such as Dirichlet process mixtures. Alternative multiscale density priors built on decision trees have many well-known advantages, including the ability to characterize abrupt local changes and to provide an estimate with a desired level of resolution. Despite their theoretical appeal, multiscale methods have typically ...
Added: October 2, 2026
Aly Ismailov, Poptsova M., Plos One 2026 Vol. 21 No. 9 Article e0355902
Added: October 2, 2026
Vereshchagin N., Dektiarev M., / Series arXiv "math". 2024.
Half-duplex communication complexity with adversary was defined in [Hoover, K., Impagliazzo, R., Mihajlin, I., Smal, A. V. Half-Duplex Communication Complexity, ISAAC 2018.] Half-duplex communication protocols generalize classical protocols defined by Andrew Yao in [Yao, A. C.-C. Some Complexity Questions Related to Distributive Computing (Preliminary Report), STOC 1979]. It has been unknown so far whether the ...
Added: August 19, 2024
Ignatiev A., Mihajlin I., Smal A., , in: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). LIPIcs, Volume 248.: Saarbrücken, Вадерн: Schloss-Dagstuhl - Leibniz Zentrum für Informatik, 2022. Ch. 66.
Added: November 9, 2023
Vyalyi M., Problems of Information Transmission 2021 Vol. 57 No. 2 P. 143–160
We consider a generalization of the Pólya–Kasteleyn approach to counting the number of perfect matchings in a graph based on computing the symbolic Pfaffian of a directed adjacency matrix of the graph. Complexity of algorithms based on this approach is related to the complexity of the sign function of a perfect matching in generalized decision ...
Added: August 20, 2021
Podolskii V. V., Sherstov A., ACM Transactions on Computation Theory 2020 Vol. 12 No. 4 P. 26
A major goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems f:({0, 1}^n)^k → {0, 1} with k > log n parties. We study the problems of inner product and set disjointness and determine their randomized communication complexity for every k ≥ log n, showing in both cases that Θ(1 + ⌈log n⌉/ log ⌈1 + k/ log n⌉) bits are necessary and ...
Added: December 23, 2020
Klenin E., Kozachinskiy A., , in: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)Vol. 117.: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. P. 1–15.
Added: August 28, 2018
Shitov Y., Discrete and Computational Geometry 2019 Vol. 61 No. 3 P. 653–660
A Euclidean distance matrix D(α) is defined by D_ij=(α_i−α_j)^2, where α=(α_1,…,α_n) is a real vector. We prove that D(α) cannot be written as a sum of [2sqrt(n)−2] nonnegative rank-one matrices, provided that the coordinates of α are algebraically independent. As a corollary, we provide an asymptotically optimal separation between the complexities of quantum and classical communication protocols computing a given matrix in expectation. ...
Added: March 15, 2018