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...
Saved in:
Main Author: | Ameen Ali, Mohammed Ba Homaid |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/38470/1/A%20hybrid%20kidney%20algorithm%20strategy%20for%20combinatorial%20interaction%20testing%20problem.ir.pdf http://umpir.ump.edu.my/id/eprint/38470/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A kidney algorithm with elitism for combinatorial testing problem
by: Bahomaid, Ameen A., et al.
Published: (2020) -
ABC Algorithm for Combinatorial Testing Problem
by: Alsewari, Abdulrahman A., et al.
Published: (2017) -
A variable combinatorial test suite strategy based on modified greedy algorithm
by: Homaid, Ameen A. Ba, et al.
Published: (2015) -
A Kidney Algorithm for Pairwise Test Suite Generation
by: Homaid, Ameen A. Ba, et al.
Published: (2018) -
Firefly combinatorial test list generator for IoT systems
by: Alsewari, Abdulrahman A., et al.
Published: (2018)