Downloads provided by UsageCounts
handle: 10016/6222
Grammatical evolution is an evolutionary algorithm able to develop, starting from a grammar, programs in any language. Starting from the point that individual learning can improve evolution, in this paper it is proposed an extension of Grammatical evolution that looks at learning by reinforcement as a learning method for individuals. This way, it is possible to incorporate the Baldwinian mechanism to the evolutionary process. The effect is widened with the introduction of the Lamarck hypothesis. The system is tested in two different domains: a symbolic regression problem and an even parity Boolean function. Results show that for these domains, a system which includes learning obtains better results than a grammatical evolution basic system.
Informática, Learning (artificial intelligence), Software engineering, Programming language semantics, Evolutionary computation, Boolean functions
Informática, Learning (artificial intelligence), Software engineering, Programming language semantics, Evolutionary computation, Boolean functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 6 | |
| downloads | 33 |

Views provided by UsageCounts
Downloads provided by UsageCounts