IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation

DOI10.1007/978-3-030-43120-4_24OpenAlexW3011086502MaRDI QIDQ5014686FDOQ5014686

Authors:

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43120-4_24

Recommendations

• Evaluation of tie-breaking and parameter ordering for the IPO family of algorithms used in covering array generation
• Problems and algorithms for covering arrays
• In-parameter-order strategies for covering perfect hash families
• Mixed optimization combinatorial method for constructing covering arrays
• A two-stage algorithm for combinatorial testing

zbMATH Keywords

quantum-inspired algorithmscovering arraysalgorithmic generationIPO strategy

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• A survey on the problems and algorithms for covering arrays via set covers
• Introduction to combinatorial testing
• An efficient design and implementation of the in-parameter-order algorithm

Cited In (1)

• Heuristically enhanced IPO algorithms for covering array generation

Uses Software

• ACTS
• CAgen

This page was built for publication: IPO-Q: A Quantum-Inspired Approach to the IPO Strategy Used in CA Generation

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