1) GA-hardness
困难度分析
1.
Research on Fitness Landscapes of Genetic Algorithms and GA-hardness;
遗传算法适应值曲面及遗传算法困难度分析
2) difficulty factors
困难因素分析
4) degree of difficulty
困难度
1.
First of all, the geometric Programmingwith D degree of difficulty is transformed into a D-dimcntional linear programming and then, intoone-dimentional searching problem.
对正项几何规划的多困难度情况提供了一个十分有效的方法。
2.
And it is important that this method can be used to produce a kind of primal algorithm for signomial geometric programming processing large scale and high degree of difficulty.
针对符号几何规划提出了一种直接的分解方法,将难于求解的符号几何规划问题等价地转化为一个非线性程度很低的可分离规划,为寻求困难度高且规模较大的符号几何规划问题的求解提供了一种方法,特别是经此方法分解后的每个子问题均易于求解,最后给出了数值实例,验证了此方法的有效性。
3.
In this paper, a direct separating method which can be used to project a kind of primal algorithm for posynomial geometric programming of large size and of high degree of difficulty is presented, the degree of nonlinearity for each separated subproblem, is very low several numerical examples are given.
它为寻求困难度较高且规模较大的几何规划问题的原算法提供了一种方法。
5) m ultiple degrees of difficulty
多困难度
补充资料：活度分析
分子式：
分子量：
CAS号：
性质：见放射化分析。
分子量：
CAS号：
性质：见放射化分析。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条