Pairwise Test Data Generation based on Flower Pollination Algorithm
Owing to an exponential increase in computational time associated with increasing number of system components, exhaustive testing is increasingly becomes impractical. Here, many researchers opt to adopt pairwise testing to minimize the overall number of tests. Recently, many existing works are focus...
Main Authors: | Nasser, Abdullah B., Alsewari, Abdulrahman A., Tairan, Nasser M., Kamal Z., Zamli |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Malaya
2017
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/19474/ http://umpir.ump.edu.my/id/eprint/19474/ http://umpir.ump.edu.my/id/eprint/19474/ http://umpir.ump.edu.my/id/eprint/19474/1/mjcs.pdf |
Similar Items
-
Comparative Study between Flower Pollination Algorithm and Cuckoo Search Algorithm for t-way Test Data Generation
by: Abdullah, Nasser, et al.
Published: (2018) -
Sequence and sequence-less T-way test suite generation strategy based on flower pollination algorithm
by: Abdullah, Nasser, et al.
Published: (2015) -
Adopting search-based algorithms for pairwise testing
by: Abdullah, Nasser, et al.
Published: (2015) -
Dynamic solution probability acceptance within the flower pollination algorithm for combinatorial t-way test suite generation
by: Abdullah, Nasser, et al.
Published: (2019) -
An adaptive flower pollination algorithm for minimizing software testing redundancy
by: M. N., Kabir, et al.
Published: (2017)