Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
A combinatorial testing (CT) is an important technique usually employed in the generation of test cases. The generation of an optimal sized test case is a Non-Deterministic Polynomial hard problem (NP). In recent times, many researchers had developed the various strategies based on the search-based...
| Main Authors: | , , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Institution of Engineering and Technology
2018
|
| 主题: | |
| 在线阅读: | http://umpir.ump.edu.my/id/eprint/23683/7/Adapting%20the%20elitism%20on%20greedy%20algorithm-INPress1.pdf |