?
Эвристика для решения задачи маршрутизации тягачей с прицепами, возникающей в реальной практике
С. 440–449.
In book
Н. Новгород: ИППИ РАН, 2014.
Martinez-Saito M., Algorithms 2025 Vol. 18 No. 12 Article 741
Detecting trajectories of hierarchical structures in a dynamical system of multiple interacting particles is an open problem that is typically addressed by imposing strong constraints on the structures to be found. Here, we describe BUNCH, a dynamical filtering algorithm that can efficiently and on-the-fly fit dynamical trajectories of multiple particles to a tree structure of ...
Added: December 1, 2025
Ilyin A., Закон 2024 № 9 С. 91–98
Every serious lawyer in his professional life is faced with a situation when, coming into contact with unknown legal matter in his work, revealing the hidden meaning of legal norms or legal institutions, he finds an unexpected way out of the impasse, discovering something new in law. Is such an expert analytical work of a ...
Added: September 26, 2024
Kham T., Вестник Томского государственного университета. Философия. Социология. Политология 2022 № 65 С. 37–50
The problems of automation of research activities are considered, primarily from the perspective of the epistemic potential of gaining new scientific knowledge without the participation of a human as a subject of science. The bases of automation are considered from the standpoint of jointly working methodological approaches to cognition: empiricism and logical positivism. The author ...
Added: July 30, 2022
Sulimov P., Kertesz-Farkas A., Journal of Proteome Research 2020 No. 19(4) P. 1481–1490
Peptide-spectrum-match (PSM) scores used in database searching are calibrated to spectrum- or spectrum-peptide-specific null distributions. Some calibration methods rely on specific assumptions and use analytical models (e.g., binomial distributions), whereas other methods utilize exact empirical null distributions. The former may be inaccurate because of unjustified assumptions, while the latter are accurate, albeit computationally exhaustive. Here, ...
Added: June 29, 2020
Lokshin I., Политическая экспертиза: ПОЛИТЭКС 2019 Т. 15 № 1 С. 45–58
The paper makes an attempt at inserting (positivistic) political science in a broader epistemological
context than it is usually conceived. The implied context is that of the contingency of the
human world which was pointed out by Aristotle in “Nicomachean Ethics” when he stated that
politics deals more with particulars than with general principles, and more with changeable ...
Added: October 29, 2019
Максимова Елизавета Андреевна, В кн.: Системное моделирование социально-экономических процессов: труды 40-й Международной научной школы-семинара.: Воронеж: Воронежский государственный педагогический университет, 2017. С. 530–533.
The creation of an effective regular timetable for railway infrastructure provides a number of advantages for both passengers being transported and for staff is involved in the management and maintenance of the network. The for-mation of a regular schedule for it under conditions of variable demand is an ac-tual problem and a rather difficult task. ...
Added: November 21, 2018
Toporkov V., Yemelyanov D., Anna Toporkova, , in: PROCEEDINGS 46th International Conference on Parallel Processing Workshops ICPPW 2017.: Piscataway: IEEE Computer Society, 2017. P. 271–280.
In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding ...
Added: January 30, 2018
Toporkov V., Yemelyanov D., Anna Toporkova, , in: Supercomputing. RuSCDays 2017. Communications in Computer and Information Science. Revised Selected Papers.Vol. 793.: Springer, 2017. P. 482–493.
In this work, a job-flow scheduling approach for grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing level of resources utilization, the set of available resources ...
Added: January 30, 2018
Toporkov V., Yemelyanov D., Anna Toporkova et al., , in: Parallel Computing Technologies. 14th International Conference, PaCT 2017, Nizhny Novgorod, Russia, September 4-8, 2017, ProceedingsVol. 10421: Lecture Notes in Computer Science .: Cham, Switzerland: Springer, 2017. P. 372–383.
In this work, a job-flow scheduling approach for Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. With increasing resources utilization level the available resources set and corresponding ...
Added: January 26, 2018
Grechikhin I., , in: Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & StatisticsVol. 197.: Springer, 2017. P. 67–76.
Vehicle Routing Problem is a well-known problem in logistics and transportation. There is a big variety of VRP problems in the literature, as they arise in many real-life situations. It is a NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible in real-life formulations. There is an important subclass of VRP, ...
Added: September 29, 2017
Baibikova T., В кн.: Актуальные проблемы развития речи и межкультурной коммуникации. Сборник материалов IX Кирилло-Мефодиевских чтений в Международном гуманитарно-лингвистическом институте 17 мая 2016 года.: М.: МФЮА, 2016. С. 109–113.
В статье рассматриваются концепты «когнитология» и «эвристика», которые являются неотъемлемой частью когнитивно-эвристической модели перевода. Обосновывается применимость данных понятий к такой отрасли человеческих знаний, как перевод и переводоведение. ...
Added: March 9, 2017
Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos, , in: Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & StatisticsVol. 197.: Springer, 2017. P. 11–26.
In our paper, we consider the Cell Formation Problem in Group Technology with grouping efficiency as an objective function. We present a heuristic approach for obtaining high-quality solutions of the CFP. The suggested heuristic applies an improvement procedure to obtain solutions with high grouping efficiency. This procedure is repeated many times for randomly generated cell ...
Added: November 29, 2016
Ivan S. Grechikhin, /. 2016.
Vehicle Routing Problem is a well-known problem in logistics and trans- portation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, Site- Dependent Truck and Trailer Routing ...
Added: October 17, 2016
Toporkov V., Anna Toporkova, Tselishchev A. et al., , in: Intelligent Distributed Computing IX. Proceedings of the 9th International Symposium on Intelligent Distributed Computing – IDC'2015, Guimarães, Portugal, October 2015Vol. 616: Studies in Computational Intelligence.: Dordrecht, L., Cham, Heidelberg, NY: Springer, 2016. P. 189–198.
In this paper, we propose a meta-data based approach for a deliberate job flow distribution in computing environments, such as utility Grids. Under condi- tions of a heterogeneous job flow composition and a variety of resource domains, we examine how different job and resource characteristics affect the efficiency of the scheduling process. Based on the ...
Added: July 13, 2016
Komosko L. F., Batsyn M. V., Информационные технологии 2015 № 7 С. 488–494
Graph coloring problem is one of the classical combinatorial optimization problems. This problem consists in finding the minimal number of colors in which it is possible to color vertices of a graph so that any two adjacent vertices are colored in different colors. The graph coloring problem has a wide variety of applications including timetabling ...
Added: July 13, 2015
Larisa Komosko, Mikhail Batsyn, Pablo San Segundo . et al., Journal of Combinatorial Optimization 2016 No. 4 P. 1665–1677
In this paper a fast greedy sequential heuristic for the vertex colouring problem is presented. The suggested algorithm builds the same colouring of the graph as the well-known greedy sequential heuristic in which on every step the current vertex is coloured in the minimum possible colour. Our main contributions include introduction of a special matrix ...
Added: July 13, 2015