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

DOI10.1007/S11786-017-0326-0MaRDI QIDQ1993364zbMATH OpenOpenAlexFDO

Authors Kristoffer Kleine, Dimitris 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

algorithmcovering arraysgenerationoptimizationperformance

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)

Recommendations

• Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
• In-parameter-order strategies for covering perfect hash families
• A survey of methods for constructing covering arrays
• Algorithmic methods for covering arrays of higher index
• Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm

Cites work

• scientific article; zbMATH DE number 1265079 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Problems and algorithms for covering arrays
• Vector sets for exhaustive testing of logic circuits

Cited in

(8)

• Allowable processing orders in the accelerated cascade algorithm
• Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
• Factorials experiments, covering arrays, and combinatorial testing
• In-parameter-order strategies for covering perfect hash families
• Algorithmic methods for covering arrays of higher index
• Heuristically enhanced IPO algorithms for covering array generation
• IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation
• Combinatorial sequences for disaster scenario generation

Describes a project that uses

Uses Software

• ACTS
• AETG

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993364)