By Topic

IEEE Transactions on Evolutionary Computation

Issue 2 • April 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 (36 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 (36 KB)
    Freely Available from IEEE
  • Guest Editorial Special Section on Analysis and Design of Representations and Operators

    Publication Year: 2006, Page(s):105 - 107
    Request permission for commercial reuse | PDF file iconPDF (240 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From the Dandelion Code to the Rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality

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

    There are many ways to represent spanning trees in genetic algorithms (GAs). Among them are Cayley codes, which represent each tree on n vertices as a string of (n-2) integers from the set [1,n]. In 2003, Thompson showed that the Dandelion Code, a Cayley code with high locality, offers consistently better performance in a GA than all other known Cayley codes, including the Prüfer Code and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The edge-window-decoder representation for tree-based problems

    Publication Year: 2006, Page(s):124 - 144
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB) | HTML iconHTML

    We describe the "edge-window-decoder" strategy (EWD), a decoder-based redundant encoding strategy for tree-based combinatorial problems, and explore its performance on three well-known tree-based network optimization problems: the degree constrained minimum spanning tree problem (DCMST), the optimum communication spanning tree problem (OCST), and the quadratic minimum spanning tree problem (q-MST)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Biased mutation operators for subgraph-selection problems

    Publication Year: 2006, Page(s):145 - 156
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    Many graph problems seek subgraphs of minimum weight that satisfy a set of constraints. Examples include the minimum spanning tree problem (MSTP), the degree-constrained minimum spanning tree problem (d-MSTP), and the traveling salesman problem (TSP). Low-weight edges predominate in optimum solutions to such problems, and the performance of evolutionary algorithms (EAs) is often improved by biasin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation and structural difficulty in genetic programming

    Publication Year: 2006, Page(s):157 - 166
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    Standard tree-based genetic programming suffers from a structural difficulty problem in that it is unable to search effectively for solutions requiring very full or very narrow trees. This deficiency has been variously explained as a consequence of restrictions imposed by the tree structure or as a result of the numerical distribution of tree shapes. We show that by using a different tree-based re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy and computational efficiency in Cartesian genetic programming

    Publication Year: 2006, Page(s):167 - 174
    Cited by:  Papers (82)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    The graph-based Cartesian genetic programming system has an unusual genotype representation with a number of advantageous properties. It has a form of redundancy whose role has received little attention in the published literature. The representation has genes that can be activated or deactivated by mutation operators during evolution. It has been demonstrated that this "junk" has a useful role an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Offline speaker segmentation using genetic algorithms and mutual information

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

    We present an evolutionary approach to speaker segmentation, an activity that is especially important prior to speaker recognition and audio content analysis tasks. Our approach consists of a genetic algorithm (GA), which encodes possible segmentations of an audio record, and a measure of mutual information between the audio data and possible segmentations, which is used as fitness function for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiobjective optimization of safety related systems: an application to short-term conflict alert

    Publication Year: 2006, Page(s):187 - 198
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    Many safety related and critical systems warn of potentially dangerous events; for example, the short term conflict alert (STCA) system warns of airspace infractions between aircraft. Although installed with current technology, such critical systems may become out of date due to changes in the circumstances in which they function, operational procedures, and the regulatory environment. Current pra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamics of two-element populations in the space of population states

    Publication Year: 2006, Page(s):199 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB) | HTML iconHTML

    An analysis of population dynamics in the space of population states is presented. The simplest case of the phenotypic evolution-a population consisting of two individuals with one real-valued trait, evolving under proportional selection and mutation with an underlying normal distribution-is considered. The focus is on the trajectories of the expected population state values generating a discrete ... 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): 210
    Request permission for commercial reuse | PDF file iconPDF (481 KB)
    Freely Available from IEEE
  • Special issue on granular computing

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

    Publication Year: 2006, Page(s): 212
    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 (34 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 (31 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
Professor Kay Chen Tan (IEEE Fellow)
Department of Computer Science
City University of Hong Kong
Kowloon Tong, Kowloon, Hong Kong
Email: kaytan@cityu.edu.hk