Alejandro Beltrán Ortega

Christiansen Grammar Evolution: Grammatical Evolution With Semantics

This paper describes Christiansen grammar evolution (CGE), a new evolutionary automatic programming algorithm that extends standard grammar evolution (GE) by replacing context-free grammars by Christiansen grammars. GE only takes into account syntactic restrictions to generate valid individuals. CGE adds semantics to ensure that both semantically and syntactically valid individuals are generated. It is empirically shown that our approach improves GE performance and even allows the solution of some problems are difficult to tackle by GE

Parallel Metropolis-Montecarlo Simulation for Potts Model using an Adaptable Network Topology based on Dynamic Graph Partitioning

In the last years, the computers have increased their capacity of calculus and networks - for the interconnection of these machines - have been improved until obtaining the actual high rates of data transferring. The programs that now a days try to take advantage of these new technologies,cannot be written using the traditional techniques of programming,since most of the algorithms were designed for being executed in only one processor, in a non concurrent form, instead of being executed concurrently in a set of processors,working and communicating through a network.This work aims to present the ongoing development of a new method to simulate the Ferromagnetic Potts model, taking into account these new technologies.