Bibliographic Details
| Title: |
On the problem of probabilistic optimization of time-limited testing. |
| Authors: |
Naumov, A.1 naumovav@mail.ru, Mkhitaryan, G.1 grgmkn@mail.ru |
| Source: |
Automation & Remote Control. Sep2016, Vol. 77 Issue 9, p1612-1621. 10p. |
| Subjects: |
Probabilistic inference, Algorithms, Stochastic programming, Linear programming, Automatic control systems |
| Abstract: |
For the distance learning systems, consideration was given to generation of individual tasks with limited performance time, and an algorithm was suggested to solve it. Such problem comes to that of integer stochastic programming with probabilistic constraints. Considered were the distributions of the random student's time of response to the task such as the Van der Linden lognormal model and the discrete model based on empirical data. It was assumed that task complexities are estimated either by an expert or by using corresponding algorithms. For the case of continuous distribution, an algorithm was proposed based on the branch-and-bound principle. Results of the numerical experiments were presented. [ABSTRACT FROM AUTHOR] |
|
Copyright of Automation & Remote Control is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
