Inducing Sequentiality Using Grammatical Genetic Codes
نویسندگان
چکیده
This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converge sequentially in time in contrast to uniform convergence observed for uniformly-scaled problems. This study uses three different grammatical genetic codes to induce sequentiality. Genotypic genes in the grammatical codes are interpreted as phenotypes according to the grammar, and the grammar induces sequential interactions among phenotypic genes. The experimental results show that the grammatical codes can indeed induce sequentiality, but the GAs using them need exponential population sizes for a reliable search.
منابع مشابه
A Comparative Study of Genetic Programming and Grammatical Evolution for Evolving Data Structures
The research presented in the paper forms part of a larger initiative aimed at automatic algorithm induction using machine learning. This paper compares the performance of two machine learning techniques, namely, genetic programming and a variation of genetic programming, grammatical evolution, for automatic algorithm induction. The application domain used to evaluate both the approaches is the...
متن کامل- 1 - Concurrency Annotations for Reusable Concurrent Software
Concurrency annotations are inserted into otherwise sequential object-oriented code, inducing a concurrent semantics that is very close to the original sequential semantics. This facilitates integrated engineering of sequential and concurrent software, in particular reuse of code across the boundary between concurrency and sequentiality. Concurrency annotations also blend well with inheritance,...
متن کاملEffects of Population, Generation and Test Case Count on Grammatical Genetic Programming for Integer Lists
This paper investigates how grammatical genetic programming performs for evolving simple integer list manipulation functions. We propose three sub-problems which are related to, or component of integer sorting problem as defined by genetic programming literature. We further investigate the effects of modifying evolutionary parameters, such as the number of generations allowed, number of populat...
متن کاملCodes Correcting Phased Burst Erasures
We introduce a family of binary array codes of size t n, correcting multiple phased burst erasures of size t. The codes achieve maximal correcting capability, i.e. being considered as codes over GF (2 t ) they are MDS. The length of the codes is n = P L `=1 t ` , where L is a constant or is slowly growing in t. The complexity of encoding and decoding is proportional to rnmL, where r is the numb...
متن کاملAGGE: A Novel Method to Automatically Generate Rule Induction Classifiers Using Grammatical Evolution
One of the main and fundamental tasks of data mining is the automatic induction of classification rules from a set of examples and observations. A variety of methods performing this task have been proposed in the recent literature. Many comparative studies have been carried out in this field. However, the main common feature between these methods is that they are designed manually. In the meanw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004