On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing
Combinatorial interaction testing is a practical approach aims to detect defects due to unwanted and faulty interactions. Here, a set of sampled test cases is generated based on t-way covering problem (where t indicates the interaction strength). Often, the generation process is based on a particula...
Main Authors: | Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A. |
---|---|
Format: | Article |
Language: | English |
Published: |
Asian Research Publishing Network (ARPN)
2015
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/18126/ http://umpir.ump.edu.my/id/eprint/18126/ http://umpir.ump.edu.my/id/eprint/18126/1/04.%20ARPN1015_2825.pdf |
Similar Items
-
Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
by: Bahomaid, Ameen A., et al.
Published: (2018) -
ABC Algorithm for Combinatorial Testing Problem
by: Alsewari, Abdulrahman A., et al.
Published: (2017) -
Benchmarking of Bat-inspired Interaction Testing Strategy
by: Kamal Z., Zamli, et al.
Published: (2016) -
A Bat-inspired Strategy for T-Way Interaction Testing
by: Kamal Z., Zamli, et al.
Published: (2015) -
Adopting search-based algorithms for pairwise testing
by: Abdullah, Nasser, et al.
Published: (2015)