Show simple item record

dc.contributor.authorPrihozhy, A. A.ru
dc.coverage.spatialМинскru
dc.date.accessioned2024-06-04T07:33:23Z
dc.date.available2024-06-04T07:33:23Z
dc.date.issued2024
dc.identifier.citationPrihozhy, A. A. Random algorithm of forming programming teams accounting for compatibility of programmers / A. A. Prihozhy // Информационные технологии в образовании, науке и производстве [Электронный ресурс] : материалы XI международной научно-технической конференции, Минск, 21-22 ноября 2023 г. / сост. М. Г. Карасёва. – Минск : БНТУ, 2024. – С. 14-20.ru
dc.identifier.urihttps://rep.bntu.by/handle/data/144488
dc.description.abstractThe compatibility of programmers is one of the main sources of increasing the efficiency of operation of programming teams. In the paper, we have proposed a random algorithm of forming teams which account for compatibility of programmers and their influence on the teams’ runtime costs. Experimental results have shown that the random algorithm forms the teams which reduce the runtime costs by up to 12,49 % compared to the teams generated by the greedy algorithm.ru
dc.language.isoenru
dc.publisherБНТУru
dc.titleRandom algorithm of forming programming teams accounting for compatibility of programmersru
dc.typeWorking Paperru


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record