В старых версиях браузеров сайт может отображаться некорректно. Для оптимальной работы с сайтом рекомендуем воспользоваться современным браузером.
We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.
HSE University researchers have become the first in the world to discover genetic predisposition to severe COVID-19. The results of the study were published in the journal Frontiers in Immunology.
On January 25, 2021, an International Laboratory of Bioinformatics opened at the Faculty of Computer Science. The main goal of the laboratory is to determine the role of alternative DNA structures in the genome.
As part of the series, ‘Modern Analytics of Education’, the Human Capital Multidisciplinary Research Center has released a report entitled ‘Entrepreneurship Training in Universities in Russia and the World’. Based on a review of best practices, the authors identified 71 skills that are fostered in entrepreneurial education abroad. The researchers selected 63 programmes and courses from 44 universities and 24 countries for analysis.
We consider the approach to construct approximation schedule with the guaranteed absolute error for the $NP-$hard scheduling problems minimizing maximum lateness.
Lazarev A. A., Salnikov A. M., Baranov A. V. In bk.: Parallel Computing Technologies. 11th International Conference, Pact 2011, Kazan, Russia, September 19-23, 2011. Proceedings. Iss. 6873. NY: Springer, 2011. P. 469-466.
Gafarov E., Lazarev A. A., Werner F. Otto-von-Guericke Universitaet, 2010. No. 20.
In this paper, we present a modification of dynamic programming algorithms (DPA), which we denote as graphical algorithms (GrA). For the knapsack problem and some single machine scheduling problems, it is shown that the time complexity of the GrA is less that the time complexity of the standard DPA. Moreover, the average running time of the GrA is often essentially smaller. A GrA can also solve largescale instances and instances, where the parameters are not integer. In addition, for some problems, GrA has a polynomial time complexity in contrast to a pseudo-polynomial complexity of DPA.
Лазарев А. А., Кварацхелия А. Г. Автоматика и телемеханика. 2010. № 10. С. 80-89.
In this paper, we consider the minimizing total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine. This problem is known to be open. Here, we give some properties of optimal schedules for the problem and its special cases.
In a fast changing global economy governed by Enterprise Services and the Future Internet, enterprises and virtual factories will self-organize in distributed, interoperable, innovation Ecosystems where the issues of Enterprise Interoperability need to be solved in a multi-view of information, services and processes throughout Enterprise Networks.
Гинтова М. А., Костырко А. А., Плаксин С. М. и др. Вопросы государственного и муниципального управления. 2012. № 1. С. 7-25.
In this paper the authors analyze the optimization of public service delivery in Russia. The role of the optimization of administrative processes in the modernization of public administration is also considered; major activities aimed at the optimization of the public services delivery in 2010-2011 are described; some background information for decision making process is revealed; major methods of improving quality and accessibility of public services are analyzed; the key methodological approaches for the reengineering of public services and spheres of government regulations are presented. Basing on the researches conducted, the authors propose the ways of making the activities aimed at the optimization of public services effi cient.