An efficient design and implementation of the in-parameter-order algorithm

DOI10.1007/s11786-017-0326-0zbMath1398.05046OpenAlexW2774274323MaRDI QIDQ1993364

Kristoffer Kleine, Dimitris E. Simos

Publication date: 5 November 2018

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-017-0326-0

zbMATH Keywords

performanceoptimizationalgorithmgenerationcovering arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Discrete mathematics in relation to computer science (68R99) General topics in the theory of algorithms (68W01)

Related Items (5)

Combinatorial sequences for disaster scenario generation ⋮ Factorials experiments, covering arrays, and combinatorial testing ⋮ IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation ⋮ Algorithmic methods for covering arrays of higher index ⋮ Heuristically enhanced IPO algorithms for covering array generation

Uses Software

• AETG
• ACTS

Cites Work

• Unnamed Item
• Unnamed Item
• Problems and algorithms for covering arrays
• Vector sets for exhaustive testing of logic circuits

This page was built for publication: An efficient design and implementation of the in-parameter-order algorithm