Found: 23
Select item for more details and to access through your institution.
Search‐based software engineering for constructing covering arrays.
- Published in:
- IET Software (Wiley-Blackwell), 2018, v. 12, n. 4, p. 324, doi. 10.1049/iet-sen.2018.5141
- By:
- Publication type:
- Article
Improved pairwise test suites for non‐prime‐power orders.
- Published in:
- IET Software (Wiley-Blackwell), 2018, v. 12, n. 3, p. 215, doi. 10.1049/iet-sen.2017.0107
- By:
- Publication type:
- Article
Metaheuristic approach for constructing functional test‐suites.
- Published in:
- IET Software (Wiley-Blackwell), 2013, v. 7, n. 2, p. 104, doi. 10.1049/iet-sen.2012.0074
- By:
- Publication type:
- Article
Mejora de K-means usando arreglos de cubrimiento incrementales para la agrupación de procesos empresariales.
- Published in:
- RISTI: Iberian Journal on Information Systems & Technologies / Revista Ibérica de Sistemas e Tecnologias de Informação, 2019, n. 23, p. 1
- By:
- Publication type:
- Article
A business process clustering algorithm using incremental covering arrays to explore search space and balanced Bayesian information criterion to evaluate quality of solutions.
- Published in:
- PLoS ONE, 2019, v. 14, n. 6, p. 1, doi. 10.1371/journal.pone.0217686
- By:
- Publication type:
- Article
A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families.
- Published in:
- Mathematical Problems in Engineering, 2018, p. 1, doi. 10.1155/2018/1860673
- By:
- Publication type:
- Article
New Upper Bounds for Covering Arrays of Order Seven.
- Published in:
- Mathematics (2227-7390), 2024, v. 12, n. 12, p. 1908, doi. 10.3390/math12121908
- By:
- Publication type:
- Article
Weight Vector Definition for MOEA/D-Based Algorithms Using Augmented Covering Arrays for Many-Objective Optimization.
- Published in:
- Mathematics (2227-7390), 2024, v. 12, n. 11, p. 1680, doi. 10.3390/math12111680
- By:
- Publication type:
- Article
Erratum to: Supercomputing and grid computing on the verification of covering arrays.
- Published in:
- 2015
- By:
- Publication type:
- Erratum
Supercomputing and grid computing on the verification of covering arrays.
- Published in:
- Journal of Supercomputing, 2012, v. 62, n. 2, p. 916, doi. 10.1007/s11227-012-0763-0
- By:
- Publication type:
- Article
A graph-based postoptimization approach for covering arrays.
- Published in:
- Quality & Reliability Engineering International, 2017, v. 33, n. 8, p. 2171, doi. 10.1002/qre.2176
- By:
- Publication type:
- Article
Las Tecnologías de la Información y la Comunicación (TIC) en educación a distancia durante la pandemia COVID-19 utilizadas en educación primaria.
- Published in:
- Dilemas Contemporáneos: Educación, Política y Valores, 2021, v. 9, p. 1
- By:
- Publication type:
- Article
Research Notes: Binary Test-Suites Using Covering Arrays.
- Published in:
- International Journal of Software Engineering & Knowledge Engineering, 2018, v. 28, n. 9, p. 1321, doi. 10.1142/S0218194018500377
- By:
- Publication type:
- Article
SAGRAD: A Program for Neural Network Training with Simulated Annealing and the Conjugate Gradient Method.
- Published in:
- Journal of Research of the National Institute of Standards & Technology, 2015, v. 120, p. 113, doi. 10.6028/jres.120.009
- By:
- Publication type:
- Article
An Approach to Aid Decision-Making by Solving Complex Optimization Problems Using SQL Queries.
- Published in:
- Applied Sciences (2076-3417), 2022, v. 12, n. 9, p. N.PAG, doi. 10.3390/app12094569
- By:
- Publication type:
- Article
A low spatial complexity algorithm to generate combinations with the strong minimal change property.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2019, v. 11, n. 5, p. N.PAG, doi. 10.1142/S1793830919500605
- By:
- Publication type:
- Article
New optimal covering arrays using an orderly algorithm.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2018, v. 10, n. 1, p. -1, doi. 10.1142/S1793830918500118
- By:
- Publication type:
- Article
hClique: An exact algorithm for maximum clique problem in uniform hypergraphs.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2017, v. 9, n. 6, p. -1, doi. 10.1142/S1793830917500781
- By:
- Publication type:
- Article
Near-optimal algorithm to count occurrences of subsequences of a given length.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2017, v. 9, n. 3, p. -1, doi. 10.1142/S1793830917500422
- By:
- Publication type:
- Article
Construction of non-isomorphic covering arrays.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2016, v. 8, n. 2, p. -1, doi. 10.1142/S1793830916500336
- By:
- Publication type:
- Article
CONSTRUCTION OF MIXED COVERING ARRAYS OF STRENGTHS 2 THROUGH 6 USING A TABU SEARCH APPROACH.
- Published in:
- Discrete Mathematics, Algorithms & Applications, 2012, v. 4, n. 3, p. -1, doi. 10.1142/S1793830912500334
- By:
- Publication type:
- Article
New Bounds for Ternary Covering Arrays Using a Parallel Simulated Annealing.
- Published in:
- Mathematical Problems in Engineering, 2012, v. 2012, p. 1, doi. 10.1155/2012/897027
- By:
- Publication type:
- Article
Optimal shortening of uniform covering arrays.
- Published in:
- PLoS ONE, 2017, v. 12, n. 12, p. 1, doi. 10.1371/journal.pone.0189283
- By:
- Publication type:
- Article