Experiments With Explicit ForLoops in Genetic RMIT University实验用显式循环遗传坎培门高等技术学院.pptVIP

下载本文档

5
0
约1.23万字
约 29页
2018-06-15 发布于福建
举报
版权申诉

Experiments With Explicit ForLoops in Genetic RMIT University实验用显式循环遗传坎培门高等技术学院.ppt

1、本文档共29页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Experiments With Explicit ForLoops in Genetic RMIT University实验用显式循环遗传坎培门高等技术学院

Experiments With Explicit For-Loops in Genetic Programming Vic Ciesielski, Xiang Li {vc, xiali}@cs.rmit.edu.au School of Computer Science and Information Technology RMIT University, Australia Overview Introduction Why do we experiment loops? Related works Who have used loops in GP before? Syntax and Semantic of the For-Loops Experiments and Results Santa Fe Ant Problem Sorting Problem Conclusion Use loops to achieve your goals quicker and better Introduction Why do we experiment loops? Powerful – provide a mechanism for repetition. Why loops are seldom used in GP? Hard to evolve {start, end, body, update branch} Avoid infinity Large class of problems can be solved without loops Implicit loops are used. {Robsoccer, Santa Fe Ant} Type of loops For-loops and while-loops The research is focusing on for-loops. Loop Syntax Expectations Two for-loop constructs are used (FOR-LOOP1 NUM-INTERATIONS BODY) (FOR-LOOP2 START END BODY) Two strategies for setting values for NUM-ITERATIONS, START and END Set the value to a random integer (simple loops). Set the value to a result of any computation (unrestricted loops). Investigation and Expectation Convergence behavior, size and solutions Simple loops are easier to evolve than unrestricted loops Related Works [1] John R. Koza, Forrest H Bennet III, David Andre, and Martin A. Keane. Genetic Programming III; Darwinian invention and problem solving. Morgan Kaufmann, 1999. ADL – automatically defined loops – pre-established maximum number of execution [2] Kenneth E. Kinnear, Jr. Generality and difficulty in genetic programming: Evolving a sort. In Stephanie Forrest, editor, Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93,pages 287–294, University of Illinois at Urbana-Champaign, 17-21 1993.Morgan Kaufmann. A sorting algorithm – restricted total and individual loops times. – Inverse sized fitness measure [3] William B. Langdon. Data structures and genetic programming. In Peter J. Angeline and K. E. K