Covering Arrays (CA) are mathematical objects used in the functional testing of software components. They enable the testing of all interactions of a given size of input parameters in a procedure, function, or logical unit in general, using the minimum number of test cases. Building CA is a complex task (NP-complete problem) that involves lengthy execution times and high computational loads. The most effective methods for building CAs are algebraic, Greedy, and metaheuristic-based. The latter have reported the best results to date. This paper presents a description of the major contributions made by a selection of different metaheuristics, including simulated annealing, tabu search, genetic algorithms, ant colony algorithms, particle swarm ...
Search techniques can dramatically change our ability to solve a host of problems in applied science...
Chicano, F., Ferreira M., & Alba E. (2011). Comparing Metaheuristic Algorithms for Error Detection ...
International audienceMetaheuristics exhibit desirable properties like simplicity, easy parallelizab...
Covering Arrays (CA) are mathematical objects used in the functional testing of software components....
A good strategy to test a software component involves the generation of the whole set of cases that ...
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns ove...
A covering array (CA) is a combinatorial structure specified as a matrix of N rows and k columns ove...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Software behavior depends on many factors. Combinatorial testing aims to generate small sets of test...
Introduction: Currently, software quality is a fundamental feature to ensure a space in the global m...
This talk provides a complete background on metaheuristics and presents in a unified view the main d...
Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discove...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
International audienceMetaheuristics for Hard Optimization comprises of three parts. The first part ...
The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulate...
Search techniques can dramatically change our ability to solve a host of problems in applied science...
Chicano, F., Ferreira M., & Alba E. (2011). Comparing Metaheuristic Algorithms for Error Detection ...
International audienceMetaheuristics exhibit desirable properties like simplicity, easy parallelizab...
Covering Arrays (CA) are mathematical objects used in the functional testing of software components....
A good strategy to test a software component involves the generation of the whole set of cases that ...
Covering arrays (CAs) are combinatorial structures specified as a matrix of N rows and k columns ove...
A covering array (CA) is a combinatorial structure specified as a matrix of N rows and k columns ove...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Software behavior depends on many factors. Combinatorial testing aims to generate small sets of test...
Introduction: Currently, software quality is a fundamental feature to ensure a space in the global m...
This talk provides a complete background on metaheuristics and presents in a unified view the main d...
Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to discove...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
International audienceMetaheuristics for Hard Optimization comprises of three parts. The first part ...
The aim of this work was to compare metaheuristic Ant Colony with other metaheuristics like Simulate...
Search techniques can dramatically change our ability to solve a host of problems in applied science...
Chicano, F., Ferreira M., & Alba E. (2011). Comparing Metaheuristic Algorithms for Error Detection ...
International audienceMetaheuristics exhibit desirable properties like simplicity, easy parallelizab...