4 search results - page 1 / 1 » Roux-type constructions for covering arrays of strengths thr... |
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
DM
2008
13 years 5 months ago
2008
A covering array CA(N; t, k, v) is an N
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...
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...