A hybrid kidney algorithm strategy for combinatorial interaction testing problem
Combinatorial Interaction Testing (CIT) generates a sampled test case set (Final Test Suite (FTS)) instead of all possible test cases. Generating the FTS with the optimum size is a computational optimization problem (COP) as well as a Non-deterministic Polynomial hard (NP-hard) problem. Recent studi...
| 第一著者: | |
|---|---|
| フォーマット: | 学位論文 |
| 言語: | 英語 |
| 出版事項: |
2022
|
| 主題: | |
| オンライン・アクセス: | http://umpir.ump.edu.my/id/eprint/38470/1/A%20hybrid%20kidney%20algorithm%20strategy%20for%20combinatorial%20interaction%20testing%20problem.ir.pdf |