Matches in SemOpenAlex for { <https://semopenalex.org/work/W128385114> ?p ?o ?g. }
Showing items 1 to 56 of
56
with 100 items per page.
- W128385114 endingPage "209" @default.
- W128385114 startingPage "198" @default.
- W128385114 abstract "A Covering Array (CA), denoted by CA(N ; t, k, v), is a matrix of size N ×k with entries from the set {0,1,2,...,v−1}, where in each submatrix of size N ×t appears each combination of symbols derived from vt, at least once. The Covering Arrays (CAs) are combinatorial structures that have applications in software testing. This paper defines the Problem of Optimal Shortening of Covering ARrays (OSCAR), gives its NP-Completeness proof and presents an exact and a greedy algorithms to solve it. The OSCAR problem is an optimization problem that for a given matrix M consists in finding a submatrix M′ that is close to be a CA. An algorithm that solves the OSCAR problem has application as an initialization function of a metaheuristic algorithm that constructs CAs. Our algorithms were tested on a benchmark formed by 20 instances of the OSCAR problem, derived from 12 CAs taken from the scientific literature. From the solutions of the 20 instances of the OSCAR problem, 12 were transformed into CAs through a previously reported metaheuristic algorithm for the construction of CAs." @default.
- W128385114 created "2016-06-24" @default.
- W128385114 creator A5025796428 @default.
- W128385114 creator A5064414262 @default.
- W128385114 creator A5079006360 @default.
- W128385114 date "2011-01-01" @default.
- W128385114 modified "2023-10-18" @default.
- W128385114 title "Optimal Shortening of Covering Arrays" @default.
- W128385114 cites W1500365214 @default.
- W128385114 cites W1977575391 @default.
- W128385114 cites W1978203195 @default.
- W128385114 cites W1986348493 @default.
- W128385114 cites W1997203758 @default.
- W128385114 cites W2025672288 @default.
- W128385114 cites W2055249322 @default.
- W128385114 cites W2084035360 @default.
- W128385114 cites W2094071977 @default.
- W128385114 cites W2122796178 @default.
- W128385114 cites W2128204165 @default.
- W128385114 cites W2143996311 @default.
- W128385114 cites W2161095620 @default.
- W128385114 cites W2166614386 @default.
- W128385114 cites W4253725894 @default.
- W128385114 doi "https://doi.org/10.1007/978-3-642-25324-9_17" @default.
- W128385114 hasPublicationYear "2011" @default.
- W128385114 type Work @default.
- W128385114 sameAs 128385114 @default.
- W128385114 citedByCount "1" @default.
- W128385114 countsByYear W1283851142022 @default.
- W128385114 crossrefType "book-chapter" @default.
- W128385114 hasAuthorship W128385114A5025796428 @default.
- W128385114 hasAuthorship W128385114A5064414262 @default.
- W128385114 hasAuthorship W128385114A5079006360 @default.
- W128385114 hasConcept C11413529 @default.
- W128385114 hasConcept C41008148 @default.
- W128385114 hasConceptScore W128385114C11413529 @default.
- W128385114 hasConceptScore W128385114C41008148 @default.
- W128385114 hasLocation W1283851141 @default.
- W128385114 hasOpenAccess W128385114 @default.
- W128385114 hasPrimaryLocation W1283851141 @default.
- W128385114 hasRelatedWork W2003465964 @default.
- W128385114 hasRelatedWork W2333698505 @default.
- W128385114 hasRelatedWork W2351491280 @default.
- W128385114 hasRelatedWork W2358668433 @default.
- W128385114 hasRelatedWork W2371447506 @default.
- W128385114 hasRelatedWork W2386767533 @default.
- W128385114 hasRelatedWork W2390279801 @default.
- W128385114 hasRelatedWork W2748952813 @default.
- W128385114 hasRelatedWork W2899084033 @default.
- W128385114 hasRelatedWork W303980170 @default.
- W128385114 isParatext "false" @default.
- W128385114 isRetracted "false" @default.
- W128385114 magId "128385114" @default.
- W128385114 workType "book-chapter" @default.