A formal analysis of the computational dynamics in GIGANTEC.

Amr Badr

Mathware and Soft Computing (2001)

  • Volume: 8, Issue: 2, page 137-152
  • ISSN: 1134-5632

Abstract

top
An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical model is developed to analyze the behaviour of the algorithm. The model is dependent in its analysis on classical Compilers Theory, Game Theory and Markov Chains and its convergence characteristics. The results conclude that a limiting state is reached, which is independent of the initial population and the mutation rate, but dependent on the cardinality of the alphabet of the driving L-system.

How to cite

top

Badr, Amr. "A formal analysis of the computational dynamics in GIGANTEC.." Mathware and Soft Computing 8.2 (2001): 137-152. <http://eudml.org/doc/39219>.

@article{Badr2001,
abstract = {An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical model is developed to analyze the behaviour of the algorithm. The model is dependent in its analysis on classical Compilers Theory, Game Theory and Markov Chains and its convergence characteristics. The results conclude that a limiting state is reached, which is independent of the initial population and the mutation rate, but dependent on the cardinality of the alphabet of the driving L-system.},
author = {Badr, Amr},
journal = {Mathware and Soft Computing},
keywords = {Algoritmos genéticos; Lenguajes algorítmicos; Modelo dinámico; Cadenas de Markov; Compiladores; evolutionary algorithm; compilers theory},
language = {eng},
number = {2},
pages = {137-152},
title = {A formal analysis of the computational dynamics in GIGANTEC.},
url = {http://eudml.org/doc/39219},
volume = {8},
year = {2001},
}

TY - JOUR
AU - Badr, Amr
TI - A formal analysis of the computational dynamics in GIGANTEC.
JO - Mathware and Soft Computing
PY - 2001
VL - 8
IS - 2
SP - 137
EP - 152
AB - An evolutionary algorithm formalism has been forwarded in a previous research, and implemented in the system GIGANTEC: Genetic Induction for General Analytical Non-numeric Task Evolution Compiler [Bad98][Bad99]. A dynamical model is developed to analyze the behaviour of the algorithm. The model is dependent in its analysis on classical Compilers Theory, Game Theory and Markov Chains and its convergence characteristics. The results conclude that a limiting state is reached, which is independent of the initial population and the mutation rate, but dependent on the cardinality of the alphabet of the driving L-system.
LA - eng
KW - Algoritmos genéticos; Lenguajes algorítmicos; Modelo dinámico; Cadenas de Markov; Compiladores; evolutionary algorithm; compilers theory
UR - http://eudml.org/doc/39219
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.