- author = "Ryan E. Dougherty and Erin Lanus and Charles J. Colbourn and Stephanie Forrest",
- title = "Genetic Algorithms for Affine Transformations to Existential t-Restrictions",
- booktitle = "7th edition of GI @ GECCO 2019",
- year = "2019",
- month = jul # " 13-17",
- editor = "Brad Alexander and Saemundur O. Haraldsson and Markus Wagner and John R. Woodward",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
- address = "Prague, Czech Republic",
- pages = "1707--1708",
- organisation = "SIGEVO",
- keywords = "genetic algorithms, genetic programming, genetic improvement, combinatorial interaction testing, CIT, covering array, covering perfect hash family, t-restriction",
- isbn13 = "978-1-4503-6748-6",
-
URL = "
https://forrest.biodesign.asu.edu/data/publications/2019-dougherty-gecco-workshop.pdf",
-
DOI = "
10.1145/3319619.3326823",
-
video_url = "
https://www.youtube.com/watch?v=2hFlvHZU2FI",
- size = "2 pages",
- abstract = "The subject of t-restrictions has garnered considerable interest recently as it encompasses many different types of combinatorial objects, all of which have unique and important applications. One of the most popular of these is an ingredient in the generation of covering arrays, which are used for discovering faulty interactions among software components. We focus on existential t-restrictions, which have a structure that can be exploited by genetic algorithms. In particular, recent work on such restrictions considers affine transformations while maximizing the corresponding score of the formed restriction. We propose to use genetic algorithms for existential t-restrictions by providing a general framework that can be applied to all such objects.",
-
notes = "
presentation https://www.youtube.com/watch?v=2hFlvHZU2FI
Also known as \cite{Dougherty:2019:GECCOcomp}
Also known as \cite{3326823} GECCO-2019 A Recombination of the 28th International Conference on Genetic Algorithms (ICGA) and the 24th Annual Genetic Programming Conference (GP)",
