Robert Elliott Smith

Learn More
Specifically, we apply genetic algorithms that include diploid genotypes and dominance operators to a simple nonstationary problem in function optimization: an oscillating, blind knapsack problem. In doing this, we find that diploidy and dominance induce a form of long term distributed memory that stores and occasionally remembers good partial solutions(More)
This paper describes an immune system model based on binary strings. The purpose of the model is to study the pattern recognition processes and learning that take place at both the individual and species levels in the immune system. The genetic algorithm (GA) is a central component of the model. The paper reports simulation experiments on two pattern(More)
In typical applications, genetic algorithms (GAs) process populations of potential problem solutions to evolve a single population member that specifies an “optimized” solution. The majority of GA analysis has focused on these optimization applications. In other applications (notably learning classifier systems and certain connectionist learning systems), a(More)
Diffusion MRI streamlines tractography suffers from a number of inherent limitations, one of which is the accurate determination of when streamlines should be terminated. Use of an accurate streamlines propagation mask from segmentation of an anatomical image confines the streamlines to the volume of the brain white matter, but does not take full advantage(More)
We propose that bio-inspired algorithms are best developed and analysed in the context of a multidisciplinary conceptual framework that provides for sophisticated biological models and well-founded analytical principles, and we outline such a framework here, in the context of AIS network models. We further propose ways to unify several domains into a common(More)
While genetically inspired approaches to multi-objective optimization have many advantages over conventional approaches, they do not explicitly exploit directional/gradient information. This paper describes how steepestdescent, multi-objective optimization theory can be combined with EC concepts to produce improved algorithms. It shows how approximate(More)