By Topic

IEEE Transactions on Evolutionary Computation

Issue 1 • Date Feb. 2006

Filter Results

Displaying Results 1 - 16 of 16
  • Table of contents

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • IEEE Transactions on Evolutionary Computation publication information

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Bounds for probability of success of classical genetic algorithm based on hamming distance

    Publication Year: 2006, Page(s):1 - 18
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB) | HTML iconHTML

    Genetic algorithms have proven to be reasonably good optimization algorithms. Despite many successful applications, there is a lack of theoretical insight into why they work so well. In this paper, Vose-Liepins' so called "infinite population model" is used to derive a lower and upper bound for the expected probability of the global optimal solution under proportional selection and uniform crossov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance

    Publication Year: 2006, Page(s):19 - 28
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB) | HTML iconHTML

    A genetic algorithm (GA) is proposed that uses a variable population size and periodic partial reinitialization of the population in the form of a saw-tooth function. The aim is to enhance the overall performance of the algorithm relying on the dynamics of evolution of the GA and the synergy of the combined effects of population size variation and reinitialization. Preliminary parametric studies t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A faster algorithm for calculating hypervolume

    Publication Year: 2006, Page(s):29 - 38
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB) | HTML iconHTML

    We present an algorithm for calculating hypervolume exactly, the Hypervolume by Slicing Objectives (HSO) algorithm, that is faster than any that has previously been published. HSO processes objectives instead of points, an idea that has been considered before but that has never been properly evaluated in the literature. We show that both previously studied exact hypervolume algorithms are exponent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolving the structure of hidden Markov models

    Publication Year: 2006, Page(s):39 - 49
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    A genetic algorithm (GA) is proposed for finding the structure of hidden Markov Models (HMMs) used for biological sequence analysis. The GA is designed to preserve biologically meaningful building blocks. The search through the space of HMM structures is combined with optimization of the emission and transition probabilities using the classic Baum-Welch algorithm. The system is tested on the probl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems

    Publication Year: 2006, Page(s):50 - 66
    Cited by:  Papers (110)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB) | HTML iconHTML

    This paper concerns multiobjective optimization in scenarios where each solution evaluation is financially and/or temporally expensive. We make use of nine relatively low-dimensional, nonpathological, real-valued functions, such as arise in many applications, and assess the performance of two algorithms after just 100 and 250 (or 260) function evaluations. The results show that NSGA-II, a popular ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An organizational coevolutionary algorithm for classification

    Publication Year: 2006, Page(s):67 - 80
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Taking inspiration from the interacting process among organizations in human societies, a new classification algorithm, organizational coevolutionary algorithm for classification (OCEC), is proposed with the intrinsic properties of classification in mind. The main difference between OCEC and the available classification approaches based on evolutionary algorithms (EAs) is its use of a bottom-up se... View full abstract»

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

    Publication Year: 2006, Page(s):81 - 92
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    An evolutionary approach to the supervised reduction of dimensions is introduced in this paper. Traditionally, such reduction has been accomplished by maximizing one or another measure of class separation. Quite often, the rank deficiency of the involved covariance matrices precludes the application of this classical approach to real situations. Besides, the number of projections cannot be chosen ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated passive filter synthesis using a novel tree representation and genetic programming

    Publication Year: 2006, Page(s):93 - 100
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    This paper proposes a novel tree representation which is suitable for the analysis of RLC (i.e., resistor, inductor, and capacitor) circuits. Genetic programming (GP) based on the tree representation is applied to passive filter synthesis problems. The GP is optimized and then incorporated into an algorithm which can automatically find parsimonious solutions without predetermining the number of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology

    Publication Year: 2006, Page(s): 101
    Request permission for commercial reuse | PDF file iconPDF (481 KB)
    Freely Available from IEEE
  • Special issue on granular computing

    Publication Year: 2006, Page(s): 102
    Request permission for commercial reuse | PDF file iconPDF (133 KB)
    Freely Available from IEEE
  • Celebrating the vitality of technology the Proceedings of the IEEE [advertisement]

    Publication Year: 2006, Page(s): 103
    Request permission for commercial reuse | PDF file iconPDF (324 KB)
    Freely Available from IEEE
  • IEEE order form for reprints

    Publication Year: 2006, Page(s): 104
    Request permission for commercial reuse | PDF file iconPDF (354 KB)
    Freely Available from IEEE
  • IEEE Computational Intelligence Society Information

    Publication Year: 2006, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • IEEE Transactions on Evolutionary Computation Information for authors

    Publication Year: 2006, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (28 KB) | HTML iconHTML
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Evolutionary Computation publishes archival quality original papers in evolutionary computation and related areas including nature-inspired algorithms, population-based methods, and optimization where selection and variation are integral, and hybrid systems where these paradigms are combined. Purely theoretical papers are considered as are application papers that provide general insights into these areas of computation.
 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief

Dr. Kay Chen Tan (IEEE Fellow)

Department of Electrical and Computer Engineering

National University of Singapore

Singapore 117583

Email: eletankc@nus.edu.sg

Website: http://vlab.ee.nus.edu.sg/~kctan