Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Ekaterina Beresneva"'
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030672089
Recently the World faced force push to distant learning caused by COVID-19 disease. Statistical numbers show a notable increasing number of users of corporate educational solutions utilizing cloud architecture. However, non-cloud-based learning tools
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f127b1fd9b5fe736700e85e80dcda34
https://doi.org/10.1007/978-3-030-67209-6_36
https://doi.org/10.1007/978-3-030-67209-6_36
Publikováno v:
Educating Engineers for Future Industrial Revolutions ISBN: 9783030681975
Quite recently, considerable attention has been paid to distance learning due to mass schools and universities closing because of coronavirus disease. This fact brought to light not only strengths but also weaknesses of existing educational software
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e968e914c0ee87b5256f32d4a2f86c58
https://doi.org/10.1007/978-3-030-68198-2_5
https://doi.org/10.1007/978-3-030-68198-2_5
Autor:
Ekaterina Beresneva, Sergey Avdoshin
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 4, Pp 123-138 (2018)
The Metric Travelling Salesman Problem is a subcase of the Travelling Salesman Problem (TSP), where the triangle inequality holds. It is a key problem in combinatorial optimization. Solutions of the Metric TSP are generally used for costs minimizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::257bcb12a84f46ae36d44047edc2c8be
https://ispranproceedings.elpub.ru/jour/article/view/317
https://ispranproceedings.elpub.ru/jour/article/view/317
Autor:
Ekaterina Beresneva, Mariia Gordenko
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 3, Pp 251-270 (2018)
This article presents the results of applying various methods of system analysis (CATWOE, Rich Picture, AHP, Fuzzy AHP) to evaluation of teaching assistants. The soft and hard methods were applied. Methods of system analysis are considered as an exam
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bce5dbe15ccfa6e4668ffef872831aa
https://doi.org/10.15514/ispras-2018-30(3)-18
https://doi.org/10.15514/ispras-2018-30(3)-18
Autor:
Sergey Avdoshin, Ekaterina Beresneva
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 3, Pp 233-250 (2018)
Vehicle Routing Problem (VRP) is one of the most widely known questions in a class of combinatorial optimization problems. It is concerned with the optimal design of routes to be used by a fleet of vehicles to serve a set of customers. In this study
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c387a35780b6879dba52ea3c30c0fb8
https://doi.org/10.15514/ispras-2018-30(3)-17
https://doi.org/10.15514/ispras-2018-30(3)-17