|
ИСТИНА |
Войти в систему Регистрация |
Интеллектуальная Система Тематического Исследования НАукометрических данных |
||
Hierarchical Domain Representation in the AlgoWiki Encyclopedia: From Problems to Implementationsстатья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 29 декабря 2018 г.
- Авторы: Alexander Antonov, Alexey Frolov, Igor Konshin, Vladimir Voevodin
- Сборник: Parallel Computational Technologies
- Серия: Communications in Computer and Information Science
- Том: 910
- Год издания: 2018
- Место издания: SPRINGER
- Первая страница: 3
- Последняя страница: 15
- DOI: 10.1007/978-3-319-99673-8_1
- Аннотация: Algorithm description is the basic unit in the AlgoWiki Open Encyclopedia of Algorithmic Features. However, computational algorithms are not objectives in and of themselves: they are needed to address problems encountered in various fields of science and industry. On the other hand, there are many practical problems that can be tackled using various methods. This warrants the introduction of another basic term that fits between the concepts of a problem and an algorithm. Also, any algorithm can have different implementations, whether related to a single computing platform or to different platforms. The “problem–method–algorithm–implementation” chain is the basis for describing any subject area in AlgoWiki. This paper describes the permitted freedom in describing such chains, which arises when studying the approaches to address various practical problems.
- Добавил в систему: Антонов Александр Сергеевич