generating subspace

generating subspace的基本解释

-

生成子空间

与generating subspace相关的网络例句 [注：此内容来源于网络，仅供参考]

It realizes the global optimal computation via the local interacting agents with abilities of local perceptivity, competition and cooperation, self-learning etc. Then orthogonal design is introduced to generate an initial population of points that are scattered uniformly over the feasible solution space and to generate a crossover operator. As a result, the resulting algorithm is more robust and statistically sound. For high dimensional functions, a large memory is needed in generating an initial population with orthogonal design. To overcome this problem, a method called subspace partition is proposed, so that the memory is one tenth that of original one.

它以Multi-Agent系统为基础，通过Agent间的相互作用与每个Agent所具有的知识和自学习功能来提高算法的全局优化能力和收敛速度；同时利用正交试验设计方法产生较好的初始种群和设计正交交叉算子以获得更好的后代；针对正交试验设计产生初始化种群在函数维数很高时需很大存贮空间的缺点，提出了子空间分割法来产生所需的初始化种群，它只需要原来存贮空间的十分之一。

与generating subspace相关的网络解释 [注：此内容来源于网络，仅供参考]

generating subspace：生成子空间

生成级数 generating series | 生成子空间 generating subspace | 生成 generation