Brian W. Goldman

Learn More
We present the results of a community survey regarding genetic programming benchmark practices. Analysis shows broad consensus that improvement is needed in problem selection and experimental rigor. While views expressed in the survey dissuade us from proposing a large-scale benchmark suite, we find community support for creating a “blacklist” of problems(More)
In this paper we examine how Cartesian Genetic Programming's (CGP's) method for encoding directed acyclic graphs (DAGs) and its mutation operator bias the effective length of individuals as well as the distribution of inactive nodes in the genome. We investigate these biases experimentally using two CGP variants as comparisons: <i>Reorder</i>, a method for(More)
Discovering and exploiting the linkage between genes during evolutionary search allows the Linkage Tree Genetic Algorithm (LTGA) to maximize crossover effectiveness, greatly reducing both population size and total number of evaluations required to reach success on decomposable problems. This paper presents a comparative analysis of the most prominent LTGA(More)
Creating an Evolutionary Algorithm (EA) which is capable of automatically configuring itself and dynamically controlling its parameters is a challenging problem. However, solving this problem can reduce the amount of manual configuration required to implement an EA, allow the EA to be more adaptable, and produce better results on a range of problems without(More)
Traditional evolutionary algorithms (EAs) are powerful problem solvers that have several fixed parameters which require tuning. An increasing body of evidence suggests that the optimal values of some, if not all, EA parameters change during the course of executing an evolutionary run. This paper investigates the potential benefits of dynamic parameters by(More)
Unlike black-box optimization problems, gray-box optimization problems have known, limited, non-linear relationships between variables. Though more restrictive, gray-box problems include many real-world applications in network security, computational biology, VLSI design, and statistical physics. Leveraging these restrictions, the Hamming-Ball Hill Climber(More)