%0 Conference Paper %1 Andre:1995:ammsp %A Andre, David %B Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95) %C Pittsburgh, PA, USA %D 1995 %E Eshelman, L. %I Morgan Kaufmann %K algorithms, genetic memory programming, %P 248--255 %T The Evolution of Agents that Build Mental Models and Create Simple Plans Using Genetic Programming %@ 1-55860-370-0

@inproceedings{Andre:1995:ammsp, added-at = {2008-06-19T17:35:00.000+0200}, address = {Pittsburgh, PA, USA}, author = {Andre, David}, biburl = {https://www.bibsonomy.org/bibtex/22fa9cce9d530a5b2e9c3d3e85227d2b5/brazovayeye}, booktitle = {Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95)}, editor = {Eshelman, L.}, interhash = {cbe1171fadf6fbf1d529a7f45a72549f}, intrahash = {2fa9cce9d530a5b2e9c3d3e85227d2b5}, isbn = {1-55860-370-0}, keywords = {algorithms, genetic memory programming,}, month = {15-19 July}, notes = {Worlds 2x2, 4x4 and 8x8. Separate program trees for mapmaker and mapuser. ADFs used by mapusers only. Uses repeat, repeati (Repeat_Index), IncMem. Torrodial memory, isomophic to world. Steady state, Tournament selection (8) but with smaller (2) tournament group size for deletion. Evolved programs subjected to analysis and explanation. Evolved general solutions from limited test cases. Suggests simple strategies dominate more complex ones. GP better than random.}, pages = {248--255}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA, USA}, size = {8 pages}, timestamp = {2008-06-19T17:35:42.000+0200}, title = {The Evolution of Agents that Build Mental Models and Create Simple Plans Using Genetic Programming}, year = 1995 }