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...
Principais autores: | Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A. |
---|---|
Formato: | Artigo |
Idioma: | English |
Publicado em: |
Institution of Engineering and Technology
2018
|
Assuntos: | |
Acesso em linha: | http://umpir.ump.edu.my/id/eprint/23683/7/Adapting%20the%20elitism%20on%20greedy%20algorithm-INPress1.pdf |
Registros relacionados
-
A kidney algorithm with elitism for combinatorial testing problem
por: Bahomaid, Ameen A., et al.
Publicado em: (2020) -
A variable combinatorial test suite strategy based on modified greedy algorithm
por: Homaid, Ameen A. Ba, et al.
Publicado em: (2015) -
Firefly combinatorial test list generator for IoT systems
por: Alsewari, Abdulrahman A., et al.
Publicado em: (2018) -
Firefly combinatorial test list generator for IoT systems
por: Alsewari, Abdulrahman A., et al.
Publicado em: (2018) -
ABC Algorithm for Combinatorial Testing Problem
por: Alsewari, Abdulrahman A., et al.
Publicado em: (2017)