A survey of adaptable grammars
ACM SIGPLAN Notices
Solving NP-Complete Problems With Networks of Evolutionary Processors
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Grammatical Evolution: Evolutionary Automatic Programming in an Arbitrary Language
Hybrid networks of evolutionary processors
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Solving 3CNF-SAT and HPP in linear time using WWW
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Christiansen Grammar Evolution: Grammatical Evolution With Semantics
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
This paper shows the platform with which we implement a general methodology to automatically design NEPs to solve specific problems. We use CGE/AGE (a new genetic programming algorithm) and jNEP (a Java NEP simulator), two applications we have previously developed. This work is just a proof of viability. We are interested on linking all the modules and generating the initial population. Building this platform is relevant, because our methodology includes several non trivial steps, such as designing a grammar, and implementing and using a simulator. For this first proof we have choosen a well known problem that other authors have solved by means of NEPs.