作者: Anikó Ekárt , S. Z. Németh
关键词:
摘要: The rapid growth of program code is an important problem in genetic programming systems. In the present paper we investigate a selection scheme based on multiobjective optimization. Since want to obtain accurate and small solutions, reformulate this as We show that Pareto nondomination criterion reduces processing time without significant loss solution accuracy.