By Topic

Evolutionary Computation, 2004. CEC2004. Congress on

Date 19-23 June 2004

Go

Filter Results

Displaying Results 1 - 25 of 176
  • Selection of the most useful subset of genes for gene expression-based classification

    Publication Year: 2004, Page(s):2076 - 2083 Vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (627 KB) | HTML iconHTML

    Recently, there has been a growing interest in classification of patient samples based on gene expressions. Here the classification task is made more difficult by the noisy nature of the data, and by the overwhelming number of genes relative to the number of available training samples in the data set. Moreover, many of these genes are irrelevant for classification and have negative effect on the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evolutionary algorithm method for sampling n-partite graphs

    Publication Year: 2004, Page(s):2250 - 2257 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (497 KB) | HTML iconHTML

    The growth of use of graph-structured databases modeled on n-partite graphs has increased the ability to generate more flexible databases. However, the calculation of certain features in these databases may be highly resource-consuming. This work proposes a method for approximating these features by sampling. A discussion of the difficulty of sampling in n-partite graphs is made and an evolutionar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective evolutionary strategy for bijective S-boxes

    Publication Year: 2004, Page(s):2120 - 2123 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    Being as unique nonlinear components of block ciphers, S-boxes control the security of the cryptographic algorithms. The design of S-boxes with genetic algorithms is a recent research focus. For the popular bijective S-boxes, an effective evolutionary strategy is given in this paper, including fitness function, breeding strategy and hill climbing algorithm. Under this strategy, an effective geneti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiobjective ant colony search algorithm optimal electrical distribution system planning

    Publication Year: 2004, Page(s):1924 - 1931 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (557 KB) | HTML iconHTML

    A dynamic multiobjective, MO, algorithm based on the ant colony search, the multiobjective ant colony search algorithm, MOACS, is presented. The application domain is that of dynamic planning for electrical distribution systems. A time horizon of H years has been considered during which the distribution system are modified according to the new internal (loads) and external (market, reliability, po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-objective fast messy genetic algorithm solving deception problems

    Publication Year: 2004, Page(s):1502 - 1509 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (551 KB) | HTML iconHTML

    Deception problems are among the hardest problems to solve using ordinary genetic algorithms. Recent studies show that Bayesian optimization can help in solving these problems. This work compares the results acquired from the multiobjective fast messy genetic algorithm (MOMGA-II), multiobjective Bayesian optimization algorithm (mBOA), and the nondominated sorting genetic algorithm-II (NSGA-II) whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic algorithm for optimizing switching sequence of service restoration in distribution systems

    Publication Year: 2004, Page(s):1683 - 1690 Vol.2
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (579 KB) | HTML iconHTML

    This work proposes a genetic algorithm (GA) for a minimization problem of expected energy not supplied (EENS) during restoration process in distribution systems. The solution of the problem provides an effective service restoration strategy that improves system reliability. The proposed optimization algorithm for the problem is a two-stage genetic algorithm. The first stage GA creates radial netwo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of state-of-the-art pseudorandom number generators by means of genetic programming

    Publication Year: 2004, Page(s):1510 - 1516 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside or outside this paradigm could claim to be both robust (passing all the statistical tests, including the most demanding ones) and fast, as is the case of the proposal we present here.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A platform for evolving characters in competitive games

    Publication Year: 2004, Page(s):1420 - 1426 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (554 KB) | HTML iconHTML

    Entertainment software developers face significant challenges. In designing games with broad appeal. One of the challenges concerns creating lifelike nonplayer characters that can adapt their behavior in light of the current and prospective situation. This adaptation should be inherently novel, unrepeatable, yet within the bounds of realism. Evolutionary algorithms provide a suitable method for ge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Nei's standard genetic distance in artificial evolution

    Publication Year: 2004, Page(s):1233 - 1239 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (502 KB) | HTML iconHTML

    In recent years, not only ruggedness but also neutrality has been recognized as an important feature of a fitness landscape for genetic search. Following that the concept of neutrality in artificial evolution originates from Kimura's neutral theory in natural evolution, it is expected that the dynamics of artificial evolution in the landscapes including neutrality would be described by using techn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study on the behaviour and implementation of parent centric crossover within the generalized generation gap model

    Publication Year: 2004, Page(s):1996 - 2003 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    We report the results of our study on the behaviour and implementation of the parent centric operator (PCX) within the generalized generation gap (G3) model using five test functions of 10, 20 and 50 dimensions. Our study indicates that G3-PCX performs fairly well on most functions, but its performance is not good for highly nonlinear, multidimensional problems (Rastrigin, Ackley, Griewangk). We o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EA-lect: an evolutionary algorithm for constructing logical rules to predict election into Cooperstown

    Publication Year: 2004, Page(s):1354 - 1361 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (554 KB) | HTML iconHTML

    While several papers exist focusing on the question of election into the Baseball Hall of Fame election, all of them use the same method for building a model: regression analysis. Problems with this include the fact that regressions are continuous functions, and thus have trouble modeling binary problems. While there are some methods that work reasonably well, a logical rule, which can be evaluate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coevolution and Tartarus

    Publication Year: 2004, Page(s):1618 - 1624 Vol.2
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (589 KB) | HTML iconHTML

    Coevolution is the process of mutual adaptation of two populations. When a difficult optimization is performed with evolutionary computation, a population of adaptive test cases can strongly affect the progress of evolution. This study applies coevolution to the Tartarus task, a grid robot test problem. If the coevolving test cases are viewed as a form of parasite, then the question of virulence b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Labeled-GA with adaptive mutation rate

    Publication Year: 2004, Page(s):1851 - 1858 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (459 KB) | HTML iconHTML

    In This work we propose a modified GA that assigns a unique mutation rate to each gene based on the contribution of the respective gene's contribution to the fitness of the individual. Although the proposed model is not "parameter free", through a number of experiments, we show that the parameters for this model are significantly insensitive to the landscape of the problems compared with the mutat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An agent-based hydrogen vehicle/infrastructure model

    Publication Year: 2004, Page(s):1774 - 1779 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (509 KB) | HTML iconHTML

    An agent-based model is presented of the transition of a personal transportation system based on conventional fuels to one based on an alternative fuel, such as hydrogen, requiring a new support infrastructure. The model allows two types of agents, vehicle owners and hydrogen fuel suppliers, to interact on a grid of roads representing a metropolitan region, and shows how their initial placement on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GENACE: an efficient cultural algorithm for solving the flexible job-shop problem

    Publication Year: 2004, Page(s):1759 - 1766 Vol.2
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    This work presents an efficient methodology called GENACE for solving the flexible job-shop scheduling problem (or FJSP) with recirculation. We show how CDRs are used to solve the FJSP with recirculation by themselves and to provide a bootstrapping mechanism to initialize GENACE. We then adopt a cultural evolutionary architecture to maintain knowledge of schemata and resource allocations learned o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlocal evolutionary adaptation in gridplants

    Publication Year: 2004, Page(s):1602 - 1609 Vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (553 KB) | HTML iconHTML

    A simulated model of plant growth and evolution was studied. Plants start out as seeds on a 2D grid. Plant genomes are modeled as instructions telling a plant where to grow and where to place seeds. Energy is gained by occupying grid space in analogy to collection of light by leaf surface area. At the end of a generation, cells currently occupied by plants are cleared and the seeds dropped by all ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching for cost functions

    Publication Year: 2004, Page(s):1517 - 1524 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB) | HTML iconHTML

    Boolean function design is at the heart of cryptography, and is the subject of a great deal of theoretical research. We have use a simulated annealing approach to find functions with particular desirable cryptographic properties; for functions of a small number of variables, results with properties as good as (and sometimes better than) the best so far have been achieved. The success of this appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of kinship cooperation learning strategy and culture on the resilience of social systems in the village multi-agent simulation

    Publication Year: 2004, Page(s):1743 - 1750 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (550 KB) | HTML iconHTML

    The multi-agent village simulation was initially developed to examine the settlement and farming practices of prehispanic Pueblo Indians of the Central Mesa Verde region of Southwest Colorado (Kohler, 2000; Kohler et al.). The original model of Kohler was used to examine whether drought alone was responsible for the departure of the prehispanic Puebloan people from the Four Corners region after 70... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternative fuel adoption

    Publication Year: 2004, Page(s):2364 - 2371 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (626 KB) | HTML iconHTML

    Conversion from a widely-used automotive fuel to an alternative fuel can be seen as the coevolution of two systems: a societal system of vehicle owners and a supply infrastructure that will provide the alternative fuel. We present a cultural algorithms model that allows us to assess the impact that initial alternative fuel station distribution and cultural motivation have on alternative fuel adopt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining diversity and increasing the accuracy of classification rules through automatic speciation

    Publication Year: 2004, Page(s):2241 - 2249 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (593 KB) | HTML iconHTML

    Multiple species weighted voting (MSWV) is a genetics-based machine learning (GBML) system. MSWV uses two levels of speciation to achieve various objectives. Different species of individuals are by design assigned to each class in the data set. During training, a second level of speciation is achieved when similar individuals are allowed to automatically cluster and form subspecies. In this paper,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution strategies with controlled model assistance

    Publication Year: 2004, Page(s):1569 - 1576 Vol.2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (566 KB) | HTML iconHTML

    Evolutionary algorithms (EA) are excellent optimization tools for complex high-dimensional multimodal problems. However, they require a very large number of problem function evaluations. In many engineering and design optimization problems a single fitness evaluation is very expensive or time consuming. Therefore, standard evolutionary computation methods are not practical for such applications. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subspace FDC for sharing distance estimation

    Publication Year: 2004, Page(s):1735 - 1742 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (517 KB) | HTML iconHTML

    Niching techniques diversify the population of evolutionary algorithms, encouraging heterogeneous convergence to multiple optima. The key to an effective diversification is identifying the similarity among individuals. With no prior knowledge of the fitness landscapes, it is usually determined by uninformative assumptions on the number of peaks. We propose a method to estimate the sharing distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chemical genetic programming - evolution of amino acid rewriting rules used for genotype-phenotype translation

    Publication Year: 2004, Page(s):1639 - 1646 Vol.2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB) | HTML iconHTML

    A new method of genetic programming, named chemical genetic programming (CGP), which enables evolutionary optimization of the mapping from genotypic strings to phenotypic trees is proposed. A cell is evolved, and includes a DNA string that codes genetic information and smaller molecules for the mapping from DNA code to computational functionality. Genetic modification of a cell's DNA allows the DN... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A high-throughput computing environment for job shop scheduling (JSP) genetic algorithms

    Publication Year: 2004, Page(s):1554 - 1560 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (534 KB) | HTML iconHTML

    Genetic algorithms (GAs) have long been applied to tackling scheduling problems, particularly JSP, with varying degrees of success. However despite advances in GA theory, GAs remain a computationally expensive method of approaching scheduling problems (Wall, 1996). In particular for practical scheduling problems, such as those outlined in Madureira et al. (2001) and Noivo and Ramalhinho-Lourenco, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design of s-boxes by simulated annealing

    Publication Year: 2004, Page(s):1533 - 1537 Vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB) | HTML iconHTML

    Substitution boxes are important components in many modern day block and stream ciphers. Their study has attracted a great deal of attention over many years. The development of a variety of cryptosystem attacks has lead to the development of criteria for resilience to such attacks. Some general criteria such as high nonlinearity and low autocorrelation have been proposed (providing some protection... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.