?
Optimal Control Algorithms and Their Analysis for Short-Term Scheduling in Manufacturing Systems
Algorithms. 2018. Vol. 11. No. 5. P. 57.
Соколов Б. В., Ivanov D., Dolgui A.
Keywords: algorithms
Menshikov I., Orlov K., Berestov V. et al., Proceedings of the IEEE 2023 Article 42
in print ...
Added: April 26, 2023
Карташева А. А., Философские проблемы информационных технологий и киберпространства 2024
The problem of confirming the authenticity of works of art is especially acute in the digital environment. The issue of authentication is central to both intellectual property law and cultural communication strategies. Originality is a necessary parameter for a work to be recognized as original. Although the concept of «originality» is not enshrined in legal acts, it is an important element for the construction of «authenticity», which is often produced by «cultural intermediaries». The latter can be not only ...
Added: November 30, 2023
Kucherov G., Nekrich Y., Gawrychowski P. et al., , in : Lecture Notes in Computer Science. Vol. 8214: Proceedings of the 20th Symposium on String Processing and Information Retrieval.: Berlin : Springer, 2013. P. 129-140.
We revisit two variants of the problem of computing minimal discriminating words studied in [5]. Given a pattern P and a threshold d, we want to report (i) all shortest extensions of P which occur in less than d documents, and (ii) all shortest extensions of P which occur only in d selected documents. For ...
Added: October 30, 2013
Berlin, Heidelberg : Springer, 2013
This volume contains the papers presented at the 6th International Conference on Similarity Search and Applications (SISAP 2013), held at A Coruna, Spain, during October 2–4, 2013. The International Conference on Similarity Search and Applications (SISAP) is an annual forum for researchers and application developers in the area of similarity data management. It aims at the technological problems shared ...
Added: September 27, 2013
Konstantin Bazhanov, Obiedkov S., Annals of Mathematics and Artificial Intelligence 2014 Vol. 70 No. 1-2 P. 5-24
In this paper, we consider algorithms involved in the computation of the Duquenne–Guigues basis of implications. The most widely used algorithm for constructing the basis is Ganter’s Next Closure, designed for generating closed sets of an arbitrary closure system. We show that, for the purpose of generating the basis, the algorithm can be optimized. We ...
Added: October 26, 2013
Babenko M. A., Kociumaka T., Gawrychowski P. et al., , in : Lecture Notes in Computer Science. Vol. 8486: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching.: Springer, 2014. P. 30-39.
We revisit the problems of computing the maximal and the minimal non-empty suffixes of a substring of a longer text of length n, introduced by Babenko, Kolesnichenko and Starikovskaya [CPM’13]. For the minimal suffix problem we show that for any 1 ≤ τ ≤ logn there exists a linear-space data structure with(τ)query time and(nlogn/τ)preprocessing time. As a sample application, we show that ...
Added: June 24, 2014
Switzerland : Springer, 2017
This book constitutes the refereed proceedings of the Third Russian Supercomputing Days, RuSCDays 2017, held in Moscow, Russia, in September 2017. The 41 revised full papers and one revised short paper presented were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on parallel algorithms; supercomputer simulation; high performance architectures, ...
Added: November 15, 2017
МГУ, МАКС Пресс, 2018
The proceedings of the tenth international conference "Discrete Models in Control Systems Theory" (Moscow and Moscow Region, May 23-25, 2018) includes 100 papers on such topics as discrete functional systems, properties of discrete functions, synthesis and complexity of control systems, reliability, control and diagnostics of control systems, automata, graph theory, combinatorics, coding theory, mathematical methods ...
Added: June 14, 2018
Voskov L., Efremov S. G., В кн. : Distributed computer and communication networks: control, computation, communications (DCCN-2013). : М. : Техносфера, 2013. С. 197-199.
In this paper we propose models and algorithms for increasing lifetime of dynamically reconfigurable wireless sensor networks with a mobile sink and anonymous power supplies. A new definition and assessment model of a network lifetime in case of dynamic reconfiguration are given. We propose a new method for dynamic reconfiguration aimed at finding an optimal ...
Added: February 12, 2014
Springer, 2020
This special issue of Theory of Computing Systems consists of extended journal papers originally presented at the 13th International Computer Science Symposium in Russia (CSR 2018) held on June 6–10, 2018 in Moscow, Russia. The event was hosted by National Research University Higher School of Economics and chaired by Vladimir V. Podolskii. Preliminary versions of ...
Added: October 27, 2020
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019
Added: November 13, 2019
NY : Springer, 2013
Information systems have been developed in parallel with computer science, although information systems have roots in different disciplines including mathematics, engineering, and cybernetics. Research in information systems is by nature very interdisciplinary. As it is evidenced by the chapters in this book, dynamics of information systems has several diverse applications. The book presents the state-of-the-art ...
Added: December 12, 2013
Popkov Y., Dubnov Y. A., Popkov A. Y., Automation and Remote Control 2018 Vol. 79 No. 11 P. 2038-2051
The direct and inverse projections (DIP) method was proposed to reduce the feature space to the given dimensions oriented to the problems of randomized machine learning and based on the procedure of “direct” and “inverse” design. The “projector” matrices are determined by maximizing the relative entropy. It is suggested to estimate the information losses by ...
Added: February 12, 2019
Babenko M. A., Goldberg A. V., Gupta A. ,. et al., ACM Transactions on Algorithms 2016 Vol. 13 No. 1 P. 16:1-16:17
We consider the hub label optimization problem, which arises in designing fast preprocessing-based shortest- path algorithms. We give O(log n)-approximation algorithms for the objectives of minimizing the maximum label size (l∞-norm) and simultaneously minimizing a constant number of lp-norms. Prior to this, an O(log n)- approximation algorithm was known [Cohen et al. 2003] only for ...
Added: January 12, 2017
Springer, 2019
16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings ...
Added: October 26, 2021
Delong A., Osokin A., Isack H. et al., , in : Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). : San Francisco : IEEE, 2010. P. 2173-2180.
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involve unary, pairwise, and specialized higher-order terms. Our main contribution is to extend α-expansion so that it can simultaneously optimize “label costs” as well. An energy with label ...
Added: October 18, 2017
Kucherov G., Nekrich Y., Starikovskaya T., , in : Lecture Notes in Computer Science. Vol. 7608: Proceedings of the 19th International Symposium on String Processing and Information Retrieval.: Berlin : Springer, 2012. P. 307-317.
We study the following three problems of computing generic or discriminating words for a given collection of documents. Given a pattern $P$ and a threshold $d$, we want to report (i) all longest extensions of $P$ which occur in at least $d$ documents, (ii) all shortest extensions of $P$ which occur in less than $d$ ...
Added: October 30, 2013
M. Polyakova, Semenov A. V., Kovalyuk V. et al., IEEE Transactions on Applied Superconductivity 2019 Vol. 29 No. 5 P. 1-5
We present a simple quantum detector tomography
protocol, which allows, without ambiguities, to measure the twospot
detection efficiency and extract the hot-spot interaction length
of SNSPDs with unity intrinsic detection efficiency. We identify a
significant parasitic contribution to the measured two-spot efficiency,
related to an effect of the bias circuit, and find a way to rule
out this contribution during data ...
Added: October 23, 2019
Bliznets Ivan, Cygan M., Komosa P. et al., , in : Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. : SIAM, 2016. P. 1132-1151.
In this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper IntervalCompletion, Threshold Completion, and Trivially Perfect Completion. In these problems, the task is to add at most k edges to a given graph in order to obtain a chordal, interval, proper interval, threshold, or trivially perfect graph, respectively. We prove the following lower bounds ...
Added: October 31, 2018
Diskin E., Закон 2024 № 1 С. 26-40
The issue of the protection of legitimate rights of personas who were defamed is not new in Russian legal science. The problem of protection of honor and dignity was known to classical Roman law, was the subject of study of pre-revolutionary and Soviet lawyers. However, the classic civilistic constructions formulated in the Civil Code were ...
Added: January 30, 2024
Edward Elgar Publishing, 2019
The digital economy is gradually gaining traction through a variety of recent technological developments, including the introduction of the Internet of things, artificial intelligence and markets for data. This innovative book contains contributions from leading competition law scholars who map out and investigate the anti-competitive effects that are developing in the digital economy. ...
Added: August 4, 2020
Cham : Springer, 2018
This book constitutes the refereed proceedings of the 44th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018, held in Krems, Austria, in January/February 2018.
The 48 papers presented in this volume were carefully reviewed and selected from 97 submissions. They were organized in topical sections named: foundations of computer science; ...
Added: March 1, 2018