Categories

Archive

2008 010

Investigating Restricted Tournament Replacement in ECGA for Non-Stationary Environments

Lima,C.F., Fernandes, C., Lobo, F. G. (2008)
TR No.: 2008010 | Download PDF | Download PS

Abstract: This paper investigates the incorporation of restricted tournament replacement (RTR) in the extended compact genetic algorithm (ECGA) for solving problems with non-stationary optima. RTR is a simple yet efficient niching method used to maintain diversity in a population of individuals. While the original version of RTR uses Hamming distance to quantify similarity between individuals, […]

2008 009

Self-Adaptive Mutation in XCSF

Butz, M.V.,Stalph,P.,Lanzi, P.L. (2008)
TR No.: 2008009 | Download PDF | Download PS

Abstract: Recent advances in XCS technology have shown that self-adaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown that XCS can also be successfully applied to challenging real-valued domains including datamining, function approximation, and clustering. In this paper, we combine these two advances and investigate self-adaptive mutation […]

2008 008

Real-Coded Extended Compact Genetic Algorithm based on Mixtures of Models

Lanzi,P.L,Nichetti,L., Sastry, K., Voltini,D., Goldberg, D. E. (2008)
TR No.: 2008008 | Download PDF | Download PS

Abstract: This paper presents a real-coded estimation distribution algorithm (EDA) inspired to the extended compact genetic algorithm (ECGA) and the real-coded Bayesian Optimization Algorithm (rBOA). Like ECGA, the proposed algorithm partitions the problem variables into a set of clusters that are manipulated as independent variables and estimates the population distribution using marginal product models (MPMs); […]

2008 007

Sequential Problems that Challenge Generalization in Classifier Systems

Butz, M.V.,Lanzi, P.L. (2008)
TR No.: 2008007 | Download PDF | Download PS

We present an approach to build sequential decision making problems which can challenge the generalization capabilities of classifier systems. The approach can be applied to any sequential problem defined over a binary domain and it generates a new problem with bounded sequential difficulty and bounded generalization difficulty. As an example, the approach is used here […]

2008 006

Enhancing the Efficiency of the ECGA

Duque, T., Goldberg, D. E., Sastry, K. (2008)
TR No.: 2008006 | Download PDF | Download PS

Abstract: Evolutionary Algorithms are largely used search and optimization procedures that, when properly designed, can solve intractable problems in tractable polynomial time. Efficiency enhancements are used to turn them from tractable to practical.
In this paper we show preliminary results of two efficiency enhancements proposed for the Extended Compact Genetic Algorithm. First, a model building enhancement […]

2008 005

Linkage Learning, Rule Representation, and the χ-ary Extended Compact Classifier System

Llorà, X., Sastry, K., Lima, C. F., Lobo, F. G., Goldberg, D. E. (2008)
TR No.: 2008005 | Download PDF | Download PS

Abstract: This paper reviews a competent Pittsburgh LCS that automatically mines important substructures of the underlying problems and takes problems that were intractable with  first-generation Pittsburgh LCS and renders them tractable. Specifically, we propose a χ-ary extended compact classifier system  which uses (1) a competent genetic algorithm (GA) in the form of $\chi$-ary extended compact genetic algorithm, and (2) a niching method in […]

2008 004

Speeding Online Synthesis via Enforced Selecto-Recombination

Saruwatari, S., Llorà, X., Yasui, N. I., Tamura, H., Sastry, K., Goldberg, D. E (2008)
TR No.: 2008004 | Download PDF | Download PS

Abstract: Brainstorming has been greatly used as a method to generate a large number of ideas by variety of each participant’s knowledge. However, brainstorming does not always work well because of spatial, communication limitations. Moreover, brainstorming techniques present limited scalability. Meanwhile, genetics algorithms have been mostly regarded as an engineering or technological tool. However, the innovation intuition suggests that […]

2008 002

Improving Small Population Performance under Noise with Viral Infection + Tropism

Sato, Y., Goldberg, D. E., Sastry, K. (2008)
TR No.: 2008002 | Download PDF | Download PS

Abstract: In this paper we report on the effect of viral infection with tropism on the formation of building blocks in genetic operations. In previous research, we applied genetic algorithms to the analysis of time-series signals with noise. We demonstrated the possibility of reducing the number of required entities and improving the rate of convergence […]

2007 020

Discovering Building Blocks for Human Based Genetic Algorithms

Ueda, T., Yasui, N. I., Llorà, X., Sastry, K. Goldberg, D. E. (2008)
TR No.: 2007020 | Download PDF | Download PS

The push for rapid innovation and creativity in this Internet age places a premium on eective integration of both human and computer-generated knowledge. One of the key components of a distributed and scalable environment for accomplishing this integration called DISCUS is the human-based genetic algorithm (HBGA)–a GA where humans perform genetic operations. This paper takes […]

2007 019

Genetic Algorithms and Genetic Programming for Multiscale Modeling: Applications in Materials Science and Chemistry and Advances in Scalability

Sastry, K. (2007)
TR No.: 2007019 | Download PDF | Download PS

Abstract:
Effective and efficient multiscale modeling is essential to advance both the science and synthesis in a wide array of fields such as physics, chemistry, materials science, biology, biotechnology and pharmacology. This study investigates the efficacy and potential of using genetic algorithms for multiscale materials modeling and addresses some of the challenges involved in designing competent […]