%0 Conference Paper %1 Oltean:2003:JCIS2 %A Oltean, Mihai %B 7th Joint Conference on Information Sciences %C North Carolina %D 2003 %E (et al), Ken Chen %I Association for Intelligent Machinery %K algorithms, circuits digital expression genetic multi programming, %P 315--318 %T Solving Even-Parity Problems using Multi Expression Programming %U http://www.mep.cs.ubbcluj.ro/oltean_fea2003_2.pdf %V 1 %X Multi Expression Programming (MEP) is used for solving even-parity problems. Numerical experiments show that MEP outperforms Genetic Programming (GP) with more than one order of magnitude for the considered test cases.

@inproceedings{Oltean:2003:JCIS2, abstract = {Multi Expression Programming (MEP) is used for solving even-parity problems. Numerical experiments show that MEP outperforms Genetic Programming (GP) with more than one order of magnitude for the considered test cases.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {North Carolina}, author = {Oltean, Mihai}, biburl = {https://www.bibsonomy.org/bibtex/26e2c03fad647d9c7e71585baadb27f9e/brazovayeye}, booktitle = {7th Joint Conference on Information Sciences}, editor = {(et al), Ken Chen}, email = {moltean@cs.ubbcluj.ro}, interhash = {7355a926532ba4c85739af4811c2970f}, intrahash = {6e2c03fad647d9c7e71585baadb27f9e}, keywords = {algorithms, circuits digital expression genetic multi programming,}, month = {September}, notes = {Also available at www.mep.cs.ubbcluj.ro (including the source code).}, pages = {315--318}, publisher = {Association for Intelligent Machinery}, size = {4 pages}, timestamp = {2008-06-19T17:48:50.000+0200}, title = {Solving Even-Parity Problems using Multi Expression Programming}, url = {http://www.mep.cs.ubbcluj.ro/oltean_fea2003_2.pdf}, volume = 1, year = 2003 }