REDUCING COMPUTATION TIME OF THE DECISION TREE BUILDING FOR LINEAR PARAMETRIC PROGRAMMING PROBLEMS USING PARALLEL COMPUTATION

Kokuev Alexander Alexandrovich
National Research Nuclear University MEPhI
tutor

Abstract
This article discusses two ways to reduce the computation time of the decision tree building for linear parametric programming problems using parallel computing. The main difference between first and second way is that in latter whole problem divided into much smaller subtasks. Results of applying both methods shows that the second way gives better results. So the article concludes that decreasing subtask size is direction of future research.

Category: 05.00.00 Technical sciences

Article reference:
Reducing computation time of the decision tree building for linear parametric programming problems using parallel computation // Modern scientific researches and innovations. 2015. № 4. P. 2 [Electronic journal]. URL: https://web.snauka.ru/en/issues/2015/04/52303

View this article in Russian

Sorry, this article is only available in Русский.



Artice view count: Please wait

All articles of author «Кокуев Александр Александрович»


© If you have found a violation of copyrights please notify us immediately by e-mail or feedback form.

Contact author (comments/reviews)

Write comment

You must authorise to write a comment.

Если Вы еще не зарегистрированы на сайте, то Вам необходимо зарегистрироваться:
  • Register