By Topic

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on

Date 8-12 Dec. 2003

Go

Filter Results

Displaying Results 1 - 25 of 84
  • Patterned surface as a template for DNA-based nanotechnology

    Publication Year: 2003, Page(s):2727 - 2732 Vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1692 KB) | HTML iconHTML

    A novel method of DNA patterning on silicon surface based on atomic force microscopy (AFM) is presented. This method is based on the AFM anodic oxidation technique, which has the ability to make nano-level oxide patterns on the silicon surface. The oxide patterns drawn by the AFM anodic oxidation is used as a template for nano-patterning of biomolecules such as protein and DNA. We describe the pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using soft computing for a prototype collagen plate inspection system

    Publication Year: 2003, Page(s):2844 - 2850 Vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1649 KB) | HTML iconHTML

    A framework for the automated visual inspection of collagen plates was implemented and used in an industrial application for the evaluation of fault perceptual relevance. The here presented paper analyzes the methodologies used in this framework in order to predict the end user's opinion, especially the usage of genetic algorithm to adapt the fuzzy weights for making the final classifications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of immunological memory to the color classification of tiles

    Publication Year: 2003, Page(s):2815 - 2820 Vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1430 KB) | HTML iconHTML

    Based on mechanism that the vertebrate immune system remembers the antigen it has met before by retaining in the body some memory cells, an algorithm is proposed to search for the representative of the data set by generating its memory cells. The algorithm is first tested on a two-dimensional data set with three cluster centers to see if the memory cells built could really be representative. Then ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualizing evolvability with Price's equation

    Publication Year: 2003, Page(s):2785 - 2790 Vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1469 KB) | HTML iconHTML

    The term "premature convergence" has been used for many years as an explanation as to why an evolutionary algorithm fails to find a global optimum, without providing much insight into how to fix the problem and/or avoid it in the future. In this paper we tie these issues to notions of (lack of) evolvability that have been explored in the population genetics community for many years. In particular,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid ant colony algorithm for texture classification

    Publication Year: 2003, Page(s):2648 - 2652 Vol.4
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1493 KB) | HTML iconHTML

    We present a novel ant colony algorithm integrating genetic algorithms and simplex algorithms. This method is able to not only speed up searching process for optimal solutions, but also improve the quality of the solutions. The proposed method is applied to set up a learning model for the "tuned" mask, which is used for texture classification. Experimental results on real world images and comparis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving the multi-objective quadratic assignment problem using a fast messy genetic algorithm

    Publication Year: 2003, Page(s):2277 - 2283 Vol.4
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1592 KB) | HTML iconHTML

    The multiobjective quadratic assignment problem is an NP-complete problem with a multitude of real-world applications. The specific application addressed is the minimization of communication flows in a heterogenous mix of unmanned aerial vehicles. Developed is a multiobjective approach to solving the general mQAP for this UAV application. The combinatoric nature of this problem calls for a stochas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A k-elitist max-min ant system approach to cost-based abduction

    Publication Year: 2003, Page(s):2635 - 2641 Vol.4
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1518 KB) | HTML iconHTML

    Abduction is the process of proceeding from data describing a set of observations or events, to a set of hypotheses which best explains or accounts for the data. Cost-based abduction (CBA) is a formalism in which evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid genetic algorithm for three-index assignment problem

    Publication Year: 2003, Page(s):2762 - 2768 Vol.4
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1527 KB) | HTML iconHTML

    Three-index assignment problem (AP3) is well-known problem which has been shown to be NP-hard. This problem has been studied extensively, and many exact and heuristic methods have been proposed to solve it. Inspired by the classical assignment problem, we propose a new iterative heuristic, called fragmental optimization (FO), which solves the problem by simplifying it to the assignment problem. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning to play Pac-Man: an evolutionary, rule-based approach

    Publication Year: 2003, Page(s):2462 - 2469 Vol.4
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1633 KB) | HTML iconHTML

    Pac-Man is a well-known, real-time computer game that provides an interesting platform for research. We describe an initial approach to developing an artificial agent that replaces the human to play a simplified version of Pac-Man. The agent is specified as a simple finite state machine and ruleset. with parameters that control the probability of movement by the agent given the constraints of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Future View: Web navigation based on learning user's browsing patterns by classifier systems

    Publication Year: 2003, Page(s):2829 - 2836 Vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1661 KB) | HTML iconHTML

    In this paper, we propose a Future View system that assists user's usual Web browsing. A Future View prefetches Web pages based on user's browsing strategies and present them to a user in order to assist Web browsing. To learn browsing patterns for a user, Future View uses two types of learning classifier systems: a content-based classifier system for contents change patterns and an action-based c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The simple supply chain model and evolutionary computation

    Publication Year: 2003, Page(s):2322 - 2329 Vol.4
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1666 KB) | HTML iconHTML

    This article provides an overview of the simple supply chain model (SSCM), scenarios derived from this model and the strategies being used to begin to tackle SSCM problems. The article further provides details of how evolutionary computation is used (via population based incremental learning) to optimise parameters for the designed strategies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm based distance spectrum technique for performance union bound of space-time trellis coded OFDM

    Publication Year: 2003, Page(s):2659 - 2664 Vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1511 KB) | HTML iconHTML

    We derive the performance union bound of space-time trellis codes in orthogonal frequency division multiplexing system (STTC-OFDM) over quasistatic frequency selective fading channels based on the distance spectrum technique. The distance spectrum is the enumeration of the codeword difference measures and their multiplicities by exhausted searching through all the possible error event paths. Exhau... View full abstract»

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

    Publication Year: 2003, Page(s):2362 - 2369 Vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1684 KB) | HTML iconHTML

    This article explores the concept of connectivity and biodiversity by using a simple model of an ecosystem. The model is different from standard artificial life systems since there is no attempt to solve a particular problem, nor is there competition between individuals that drives a coevolution and fitness. Fitness gradually increases throughout the simulation, and mutation rate varies based on p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Piece difference: simple to evolve?

    Publication Year: 2003, Page(s):2470 - 2473 Vol.4
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1380 KB) | HTML iconHTML

    We detail a study into whether the 'piece difference' heuristic could be evolved for the game of checkers. A co-evolutionary algorithm is used to evolve a piece-weighting system that is used as the evaluation function in a minimax checkers player. The results suggest that the 'piece difference' heuristic will evolve if allowed, but it is not necessarily easy. The work has also demonstrated that ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making the most of two heuristics: breaking transposition ciphers with ants

    Publication Year: 2003, Page(s):2653 - 2658 Vol.4
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1520 KB) | HTML iconHTML

    Multiple anagramming is a general method for the cryptanalysis of transposition ciphers, and has a graph theoretic representation. Inspired by a partially mechanised approach used in World War II, we consider the possibility of a fully automated attack. Two heuristics based on measures of natural language are used - one to recognise plaintext, and another to guide construction of the secret key. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of fitness landscapes for the HP model of protein structure prediction

    Publication Year: 2003, Page(s):2338 - 2345 Vol.4
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1634 KB) | HTML iconHTML

    We present results from analyses of fitness landscapes of the HP model of protein structure prediction problems. The work concentrates on those issues that are likely to impact on the effectiveness of evolutionary search of those landscapes, such as massive multimodality, degeneracy, and the presence of large regions corresponding to physically infeasible solutions. In the light of previous resear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Particle swarm inspired evolutionary algorithm (PS-EA) for multiobjective optimization problems

    Publication Year: 2003, Page(s):2292 - 2297 Vol.4
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1563 KB) | HTML iconHTML

    We describe particle swarm inspired evolutionary algorithm (PS-EA), which is a hybridized evolutionary algorithm (EA) combining the concepts of EA and particle swarm theory. PS-EA is developed in aim to extend PSO algorithm to effectively search in multiconstrained solution spaces, due to the constraints rigidly imposed by the PSO equations. To overcome the constraints, PS-EA replaces the PSO equa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new class of operators to accelerate particle swarm optimization

    Publication Year: 2003, Page(s):2406 - 2410 Vol.4
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1502 KB) | HTML iconHTML

    We present some experiments with a new class of variations of mutation to accelerate the convergence of PSO. These robust mutation variations are tested on benchmark problems and the results show a significant improvement as compared to the original particle swarm optimization algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal design of a regenerative dynamic dynamometer using genetic algorithms

    Publication Year: 2003, Page(s):2665 - 2672 Vol.4
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1599 KB) | HTML iconHTML

    We present an approach for optimal design of a fully regenerative dynamic dynamometer using genetic algorithms. The proposed dynamometer system includes an energy storage mechanism to adaptively absorb the energy variations following the dynamometer transients. This allows the minimum power electronics requirement at the mains power supply grid to compensate for the losses. The overall dynamometer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DNA sequence optimization using constrained multi-objective evolutionary algorithm

    Publication Year: 2003, Page(s):2270 - 2276 Vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1722 KB) | HTML iconHTML

    Generating a set of the good DNA sequences needs to optimize multiple objectives and to satisfy several constraints. Therefore, it can be regarded as an instance of constrained multiobjective optimization problem. We apply the controlled elitist nondominating sorting genetic algorithm with constrained tournament selection to this problem. First, multiobjective approach and constrained multiobjecti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-agent based simulated stock market - testing on different types of stocks

    Publication Year: 2003, Page(s):2298 - 2305 Vol.4
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1661 KB) | HTML iconHTML

    Previously, we have developed a multiagent based simulated stock market where artificial stock traders coevolve by means of individual and social learning and learn to trade stock profitably. We tested our model on a single stock (British Petroleum) from the LSE (London Stock Exchange) where our artificial agents demonstrated dynamic learning behaviours and strong learning abilities. We extend our... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-optimizing fuzzy controller based on extreme evolution algorithm

    Publication Year: 2003, Page(s):2673 - 2677 Vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1475 KB) | HTML iconHTML

    Extreme evolution algorithm (EEA) is presented to solve fast global optimization problems. The algorithm selects parents according to extreme law but not to the fitness law. Recombining extreme elements obviously accelerates evolution procedure. Secondly, we construct a self-optimizing fuzzy controller based on the EEA. The controller shows a good performance on nonlinear optimization control. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Molecular dynamics simulation using coarse-grained model to study protein function and beyond

    Publication Year: 2003, Page(s):2719 - 2726 Vol.4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1678 KB) | HTML iconHTML

    To make an inquiry into the mechanisms of biomolecular functions, particularly of protein molecule's, we conducted molecular dynamics (MD) simulations of protein molecules using coarse-grained models that preserve 3-dimensional native structure information, together with the hope of inquiring dynamical aspect of design principle of not only molecular machines but also biomolecular computing system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite field arithmetic using self-assembly of DNA tilings

    Publication Year: 2003, Page(s):2529 - 2536 Vol.4
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1587 KB) | HTML iconHTML

    Recently, it has been shown that the simple binary arithmetic and logical operations can be computed by the process of self assembly of DNA tiles, where artificially constructed 2D DNA nanostructures called tiles attach with one-another to form complex superstructures, and in the process compute the result of these operations. We show how the DNA self assembly process can be used for computing fin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive diversity maintenance and convergence guarantee in multiobjective evolutionary algorithms

    Publication Year: 2003, Page(s):2498 - 2505 Vol.4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1681 KB) | HTML iconHTML

    The issue of obtaining a well-converged and well-distributed set of Pareto optimal solutions efficiently and automatically is crucial in multiobjective evolutionary algorithms (MOEAs). Many studies have proposed different evolutionary algorithms that can progress towards Pareto optimal sets with a wide-spread distribution of solutions. However, most mathematically convergent MOEAs desire certain p... View full abstract»

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