 |
Center for Nonlinear Studies |
One of the foundational concepts of Genetic Algorithms (GAs) is the ability to exploit previously evolved solutions to generate new solutions, just as biological evolution passes heritable traits from parents to children. A key feature of this process is identifying interdependent subsets of genes and ensuring that solutions are able to pass entire subsets to future solutions, while still allowing for genetic exploration. The Linkage Tree Genetic Algorithm (LTGA) was introduced in 2010 and is the current state-of-the-art algorithm for automatically detecting and exploiting gene interdependence. This talk will provide an in-depth look at how LTGA works, with some discussion of its current variants, uses, and limitations.
For a given software program, testing, locating the errors identified, and correcting those errors is a critical, yet expensive process. The field of Search Based Software Engineering (SBSE) addresses these phases by formulating them as search problems. This talk will discuss the state-of-the-art in SBSE for addressing automated software testing & correction, and introduce the Coevolutionary Automated Software Correction system developed at Missouri S&T’s Natural Computation Laboratory which targets the correction phase by coevolving test cases and programs at the source code level.
Host: Alexander Kent