遗传算法欺骗问题 meaning in Chinese

ga deceptive problem

Subsequently , we concluded some important definitions and theorems for ga deceptive problems , and analyzed schema deceptiveness " influence on ga - hardness
详细阐述了遗传算法欺骗问题中的各种定义及定理，描述了模式欺骗对遗传算法困难度的影响。
In addition , we make research on the convergence of genetic algorithms by analyzing the globality and monotonicity of the schemata . it is demonstrated that for some kinds of the problems , the method of searching global best schemata can greatly decrease the ix abstract solution space and lead to converging quickly and successfully to the optimum . the monotonicity of schemata is used to determine deceptive problems and , with the aid of absorbing schemata , to analyze the schematic factors leading to ga - hard problems
另外，通过分析模式的全局性和单调性，证明对于某些问题搜索其全局最优模式可以大大缩小解空间，从而导致更快、更顺利地收敛到最优解，并把模式的单调性用于对遗传算法欺骗问题的划分，结合吸收模式的性质，进一步探讨影响遗传算法困难的模式因素。