A memetic algorithm for high‐strength covering array generation
Abstract Covering array generation (CAG) is the key research problem in combinatorial testing and is an NP‐complete problem. With the increasing complexity of software under test and the need for higher interaction covering strength t, the techniques for constructing high‐strength covering arrays ar...
Saved in:
| Main Authors: | Xu Guo, Xiaoyu Song, Jian‐tao Zhou, Feiyu Wang, Kecheng Tang, Zhuowei Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-08-01
|
| Series: | IET Software |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/sfw2.12138 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A systematic review on search‐based test suite reduction: State‐of‐the‐art, taxonomy, and future directions
by: Amir Sohail Habib, et al.
Published: (2023-04-01) -
A synergic quantum particle swarm optimisation for constrained combinatorial test generation
by: Xu Guo, et al.
Published: (2022-06-01) -
Two New Bio-Inspired Particle Swarm Optimisation Algorithms for Single-Objective Continuous Variable Problems Based on Eavesdropping and Altruistic Animal Behaviours
by: Fevzi Tugrul Varna, et al.
Published: (2024-09-01) -
A novel particle swarm optimisation with mutation breeding
by: Zhe Liu, et al.
Published: (2020-10-01) -
Lithium inventory estimation of battery using incremental capacity analysis, support vector machine, particle swarm optimisation
by: Xingbo Zhang, et al.
Published: (2024-12-01)