Skip to main content

previous disabled Page of 117
and
  1. No Access

    Chapter and Conference Paper

    An extension of the Krohn-Rhodes decomposition of automata

    The notion of an irreducible semigroup has been fundamental to the Krohn-Rhodes decomposition. In this paper we study a similar concept and point out its equivalence with the Krohn-Rhodes irreducibility. We th...

    Zoltán Esik in Machines, Languages, and Complexity (1989)

  2. No Access

    Chapter and Conference Paper

    Extending Kohonen’s Self-Organizing Map** Algorithm to Learn Ballistic Movements

    Rapid limb movements are known to be initiated by a brief torque pulse at the joints and to proceed freely thereafter (ballistic movements). To initiate such movements with a desired starting velocity u requir...

    Helge Ritter, Klaus Schulten in Neural Computers (1989)

  3. No Access

    Chapter and Conference Paper

    Fast practical evolutionary timetabling

    We describe the General Examination/Lecture Timetabling Problem (GELTP), which covers a very broad range of real problems faced continually in educational institutions, and we describe how Evolutionary Algorit...

    Dave Corne, Peter Ross, Hsiao-Lan Fang in Evolutionary Computing (1994)

  4. No Access

    Chapter and Conference Paper

    A chain decomposition algorithm for the proof of a property on minimum weight triangulations

    In this paper, a chain decomposition algorithm is proposed and studied. Using this algorithm, we prove a property on minimum weight triangulations of points in the Euclidean plane, which shows that a special k...

    Yang Bo-Ting, Xu Yin-Feng, You Zhao-Yong in Algorithms and Computation (1994)

  5. No Access

    Chapter and Conference Paper

    Genetic algorithms and neighbourhood search

    Genetic algorithms (GAs) have proved to be a versatile and effective approach for solving combinatorial optimization problems. Nevertheless, there are many situations in which the simple GA does not perform pa...

    Colin R. Reeves in Evolutionary Computing (1994)

  6. No Access

    Chapter and Conference Paper

    Comparing genetic algorithms, simulated annealing, and stochastic hillclimbing on timetabling problems

    Much recent research has focussed on applying genetic algorithms (GAs) to real educational institution timetabling problems. This work is generally successful, but it is as yet unclear whether a simpler stocha...

    Peter Ross, Dave Corne in Evolutionary Computing (1995)

  7. No Access

    Chapter and Conference Paper

    Scheduling planned maintenance of the national grid

    The maintenance of the high voltage electricity transmission network in England and Wales (the National Grid) is planned so as to minimise costs taking into account:

  8. location an...

  9. W. B. Langdon in Evolutionary Computing (1995)

  10. No Access

    Chapter and Conference Paper

    Neural network initialization

    Proper initialization is one of the most important prerequisites for fast convergence of feed-forward neural networks like high order and multilayer perceptrons. This publication aims at determining the optima...

    G. Thimm, E. Fiesler in From Natural to Artificial Neural Computation (1995)

  11. No Access

    Chapter and Conference Paper

    Some combinatorial landscapes on which a Genetic Algorithm outperforms other Stochastic iterative methods

    It is of major practical and theoretical interest to investigate the conditions under which a Genetic Algorithm (GA) will perform better or worse than Simulated Annealing (SA) and/or Stochastic Hill-climbing (...

    Dave Corne, Peter Ross in Evolutionary Computing (1995)

  12. No Access

    Chapter

    Asymptotic Behavior

    The difficulties in classifying cellular automata and networks based on their global behavior have been explained in Chapter 8. The results tend to indicate that a complete classification is, at least in many ...

    Prof. Dr. Max Garzon in Models of Massive Parallelism (1995)

  13. No Access

    Chapter and Conference Paper

    Δ-Languages for sets and sub-PTIME graph transformers

    This paper discusses three successively extending versions of a set theoretic Δ-language, as a prototype for “nested” data bases query language. Corresponding finite set operations (data base queries) may be real...

    Vladimir Sazonov, Alexei Lisitsa in Database Theory — ICDT '95 (1995)

  14. No Access

    Chapter and Conference Paper

    A genetic algorithm for job-shop problems with various schedule quality criteria

    Much recent research has investigated the use of genetic algorithms (GAs) in job-shop scheduling. Mostly, this has involved comparison or construction of ingenious reprsentations and operators in the context o...

    Hsiao -Lan Fang, David Corne, Peter Ross in Evolutionary Computing (1996)

  15. No Access

    Chapter and Conference Paper

    Immune system and fault-tolerant computing

    Immune system (IS) is capable of evolving, learning, recognising and eliminating foreign molecules which invade organisms. Fault tolerant approaches consist in detecting erroneous states of an algorithm and ex...

    S. Xanthakis, S. Karapoulios, R. Pajot, A. Rozz in Artificial Evolution (1996)

  16. No Access

    Chapter and Conference Paper

    Restricted evaluation genetic algorithms with Tabu search for optimising Boolean functions as multi-level AND-EXOR networks

    In GAs applied to engineering problems (in our case, the optimisation of logic circuits) the fitness function is usually complex and the fitness evaluation is time consuming. The run time is therefore a major ...

    Julian. F. Miller, Peter Thomson in Evolutionary Computing (1996)

  17. No Access

    Chapter and Conference Paper

    Climbing up NP-hard hills

    Evolutionary algorithms are sophisticated hill-climbers. In this paper, we discuss the ability of this class of local search algorithms to provide useful and efficient heuristics to solve NP-hard problems. Our...

    D. Duvivier, Ph. Preux, E. -G. Talbi in Parallel Problem Solving from Nature — PPSN IV (1996)

  18. No Access

    Chapter and Conference Paper

    Selection of views to materialize in a data warehouse

    A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a da...

    Himanshu Gupta in Database Theory — ICDT '97 (1997)

  19. No Access

    Chapter and Conference Paper

    The dynamics of evolution strategies in the optimization of traveling salesman problems

    An analysis of the dynamic behavior of Evolution Strategies applied to Traveling Salesman Problems is presented. For a special class of Traveling Salesman Problems a stochastic model of the optimization proces...

    Hans-Thomas Nürnberg, Hans-Georg Beyer in Evolutionary Programming VI (1997)

  20. No Access

    Chapter and Conference Paper

    Scheduling planned maintenance of the South Wales region of the National Grid

    The maintenance of the high voltage electricity transmission network in England and Wales (the National Grid) is planned so as to minimise costs taking into account:

      ...

    W. B. Langdon in Evolutionary Computing (1997)

  21. No Access

    Chapter and Conference Paper

    Task decomposition based on class relations: A modular neural network architecture for pattern classification

    In this paper, we propose a new methodology for decomposing pattern classification problems based on the class relations among training data. We also propose two combination principles for integrating individu...

    Bao-Liang Lu, Masami Ito in Biological and Artificial Computation: Fro… (1997)

  22. No Access

    Chapter and Conference Paper

    SOM-Model for the development of oriented receptive fields and orientation maps from non-oriented ON-center OFF-center inputs

    We investigate the development of oriented receptive fields and an orientation map in a SOM-model which is driven by rotationally symmetric stimuli in ON-center and OFF-center input layers. To this end we use ...

    D. Brockmann, H. -U. Bauer, M. Riesenhuber in Artificial Neural Networks — ICANN'97 (1997)

previous disabled Page of 117