Christopher R. Graves

Learn More
Genetic algorithms have attracted a good deal of interest in the heuristic search community. Yet there are several diierent types of genetic algorithms with varying performance and search characteristics. In this paper we look at 3 genetic algorithms: an elitist simple genetic algorithm, the CHC algorithm and Genitor. One problem in comparing algorithms is(More)
Subset Feature Selection problems can have several attributes which may make Messy Genetic Algorithms an appropriate optimization method. First, competitive solutions may often use only a small percentage of the total available features; this can not only ooer an advantage to Messy Genetic Algorithms, it may also cause diiculties for other types of(More)
A new variant on key feature object recognition is presented. It is applied to optimal matching problems involving 2D line segment models and data. A single criterion function ranks both key features and complete object model matches. Empirical studies suggest that the key feature algorithm has run times which are dramatically less than a more general(More)
Gel-permeation chromatography (GPC) has been used to analyze transition-metal-based squares, triangles, and related supramolecular complexes. Using rhenium-containing molecular squares of different sizes, a linear calibration curve has been established, which was used for confirming the relative sizes of other assemblies. GPC can also discriminate cyclic(More)
A new variant on key feature object recognition is presented. It is applied to optimal matching problems involving 2D line segment models and data. A single criterion function ranks both key features and complete object model matches. Empirical studies suggest that the key feature algorithm has run times which are dramatically less than a more general(More)
  • 1