作者: Tommaso Urli , Markus Wagner , Frank Neumann
DOI: 10.1007/978-3-642-32937-1_11
关键词:
摘要: In this paper, we carry out experimental investigations that complement recent theoretical on the runtime of simple genetic programming algorithms [3, 7]. Crucial measures in these analyses are maximum tree size is attained during run as well population when dealing with multi-objective models. We study those detail by and analyze different an way.