This work focuses on application of rewriting systems in the context of biology-inspired development of structures in evolutionary algorithms. As a part of this work, a method has been proposed for design of general structures that uses the aforementioned principle. This document includes an introduction into the theory of sorting networks and their design, the problem of which is later shown to be solvable using the proposed method. In addition, the theoretical background of evolutionary algorithms and rewriting systems is discussed. In the field of rewriting systems, an extension to the class of IL-systems has been created for use in the proposed method. The proposed method has been successfuly applied in the design of growing sorting net...
It is a matter of fact that in Europe evolution strategies and in the U.S.A. genetic algorithms have...
In this thesis a general mathematical framework to describe evolutionary algorithms is developed. Th...
Abstract—Sorting unsigned permutations by reversals is an important and difficult problem in combina...
This work provides an introduction to the evolutionary algorithms and evolutionary design. It also d...
The aim of this paper is to introduce the readers to the field of cellular automata, their design an...
A method is presented for the construction of arbitrary even-input sorting networks exhibiting bette...
This paper demonstrates how non-typed genetic programming may be used to evolve sorting networks; sp...
Abstract. An evolutionary algorithm is combined with an application-specific developmental scheme in...
Abstract. A fundamental issue in evolutionary learning is the definition of the solution representat...
artificial neural network, automata network, evolutionary computation, genetic programming, genetic ...
This paper deals with sorting networks design using Cartesian Genetic Programming and coevolution. S...
This paper describes various methods used to encode artificial neural networks to chromosomes to be ...
Abstract. Sorting Networks (SN) are efficient tools to sort an input data sequence. They are compose...
The study uses a repetitive rule of geometric and arithmetical expression, cradle in the movement of...
This master's thesis introduces the Random Boolean Networks as a developmental model in the evolutio...
It is a matter of fact that in Europe evolution strategies and in the U.S.A. genetic algorithms have...
In this thesis a general mathematical framework to describe evolutionary algorithms is developed. Th...
Abstract—Sorting unsigned permutations by reversals is an important and difficult problem in combina...
This work provides an introduction to the evolutionary algorithms and evolutionary design. It also d...
The aim of this paper is to introduce the readers to the field of cellular automata, their design an...
A method is presented for the construction of arbitrary even-input sorting networks exhibiting bette...
This paper demonstrates how non-typed genetic programming may be used to evolve sorting networks; sp...
Abstract. An evolutionary algorithm is combined with an application-specific developmental scheme in...
Abstract. A fundamental issue in evolutionary learning is the definition of the solution representat...
artificial neural network, automata network, evolutionary computation, genetic programming, genetic ...
This paper deals with sorting networks design using Cartesian Genetic Programming and coevolution. S...
This paper describes various methods used to encode artificial neural networks to chromosomes to be ...
Abstract. Sorting Networks (SN) are efficient tools to sort an input data sequence. They are compose...
The study uses a repetitive rule of geometric and arithmetical expression, cradle in the movement of...
This master's thesis introduces the Random Boolean Networks as a developmental model in the evolutio...
It is a matter of fact that in Europe evolution strategies and in the U.S.A. genetic algorithms have...
In this thesis a general mathematical framework to describe evolutionary algorithms is developed. Th...
Abstract—Sorting unsigned permutations by reversals is an important and difficult problem in combina...