4 search results - page 1 / 1 » Memetic Algorithms for Constructing Binary Covering Arrays o... |
AE
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
MICAI
2009
Springer
13 years 11 months ago
2009
Springer
CEC
2010
IEEE
13 years 5 months ago
2010
IEEE
— This paper presents new upper bounds for binary covering arrays of variable strength constructed by using a new Simulated Annealing (SA) algorithm. This algorithm incorporates ...
ISSRE
2003
IEEE
13 years 10 months ago
2003
IEEE
Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraint...