On the problem of probabilistic optimization of time-limited testing
From MaRDI portal
Recommendations
- Using the maximum likelihood method to estimate test complexity levels
- scientific article; zbMATH DE number 4207226
- Two algorithms for estimating test complexity levels
- Optimal partitioning of testing time: theoretical properties and practical implications
- The RaPID- system: room and Proctor intelligent decider for large scale tests programming
Cites work
- Generation of integral rating by statistical processing of the test results
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problem
- On stochastic linear programming problems with the quantile criterion
- Problems in stochastic programming with probabilistic criteria
- Using the maximum likelihood method to estimate test complexity levels
Cited in
(8)- Optimal partitioning of testing time: theoretical properties and practical implications
- Two algorithms for estimating test complexity levels
- Optimal stopping time in software testing based on failure size approach
- The stochastic test collection problem: models, exact and heuristic solution approaches
- scientific article; zbMATH DE number 3844815 (Why is no real title available?)
- The RaPID- system: room and Proctor intelligent decider for large scale tests programming
- Using the maximum likelihood method to estimate test complexity levels
- On the problem of maximizing the probability of successful passing of a time-limited test
This page was built for publication: On the problem of probabilistic optimization of time-limited testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505317)
