2025-02-22T23:51:04-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-117692%22&qt=morelikethis&rows=5
2025-02-22T23:51:04-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22journaliasakpiua-article-117692%22&qt=morelikethis&rows=5
2025-02-22T23:51:04-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T23:51:04-05:00 DEBUG: Deserialized SOLR response
Математичне моделювання оптимального оброблення даних у розподілених інформаційних системах

Математичне моделювання оптимального оброблення даних у розподілених інформаційних системах

The problems of optimization of using the computing resources of a distributed information system are considered. Mathematical statements of optimization problems have been made and efficient computational algorithms for solving problems based on the greedy choice strategy and using genetic algorith...

Full description

Saved in:
Bibliographic Details
Main Authors: Tsegelyk, G. G., Krasniuk, R. P.
Format: Article
Language:Ukrainian
Published: The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" 2018
Subjects:
mathematical modeling
optimization
distributed information systems
greedy algorithm
genetic algorithm
математическое моделирование
оптимизация
распределенные информационные системы
жадный алгоритм
генетический алгоритм
математичне моделювання
оптимізація
розподілені інформаційні системи
жадібний алгоритм
генетичний алгоритм
Online Access:http://journal.iasa.kpi.ua/article/view/117692
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The problems of optimization of using the computing resources of a distributed information system are considered. Mathematical statements of optimization problems have been made and efficient computational algorithms for solving problems based on the greedy choice strategy and using genetic algorithms have been proposed. For genetic algorithms for constructing solutions close to optimal, in binary and real coding problems, the computational efficiency of introducing self-training parameters of the algorithm that provided the correction of populations in the direction of better adaptability was proposed and investigated.

Similar Items