Mobile
Log In Sign Up
Home > english-chinese > "全局极小点" in Chinese

Chinese translation for "全局极小点"

global minimum point

Related Translations:
全局比例:  overall dimension scale
全局栈:  global stack
全局方式:  global mode
全局测试:  global test
全局功能:  gf general functionglobal facility
全局变换:  global change
全局程序控制:  global program control
全局数据管理:  global data manager
有关全局:  have a bearing on the situation as a whole
全局语境:  global context
Example Sentences:
1.Two convergence theorems , which show that under suitable conditions evolution strategy asymptotically converges to a global minimum point with probability one , are given
对于有界闭集上的连续函数,证明了进化策略以概率为1收敛(几乎处处收敛)于优化问题的全局极小点
2.A chaos search for implementing optimal multi - user detection in cdma system has been proposed . computer simulation illustrated that this way has many powerful abilities . its capability is better than the traditional detection and the multi - series detection , it is near to the omd which was presented by verdu , and then its beginning condition is insensitivity , near - far insensitivity , eliminate interference , it can converge to global minimum point and hold down the noise interference
通过仿真证明:其性能优于传统检测器( cd ) 、多级多用户检测器( msd )而接近于文献[ 1 ]中提出的最佳多用户检测器( omd ) ,具有对初始条件不敏感、对“远近”问题不敏感和优良的抗干扰性能,并提高了通信系统的系统容量,能寻优到全局极小点,以及能抑制噪声干扰,而且,计算复杂度较低。
3.The bp algorithm is kind of algorithm which is in use widely in multilayer neural network , because the bp algorithm is a kind of gradient descended searching algorithm in essence , it has weaknesses such as inefficient , slow convergent speed and easy getting into local minimum , insurable to find global extreme value point for multi - modal and non - differential function in larger searching zone , which restrict neural network ’ s application in all fields . so from the principle , analysis the reasons of bp algorithm to be dropped in local minimization and propose a global optima strategy . the global optima strategy is discussed from two aspects , one of improved strategy based on model , and another based on algorithm
Bp算法是多层前向神经网络中应用最为广泛的一种算法,但是由于bp算法实质上是一种基于梯度下降的搜索算法,因此它存在着算法效率较低、收敛速度慢、易于陷入局部极小值等现状;对于较大的搜索空间、多峰值和不可微函数常常不能搜索到全局极小点,这些制约了bp网络在各个领域中的应用,本文从bp网络的工作原理出发,分析产生局部极小的原因,提出了对bp网络全局优化的改进策略。
4.7 . for the purpose of analyzing its asymptotic convergence properties the evolution strategy procedures for real - valued function optimization are described . two convergence theorems , which show that under suitable conditions the evolution strategy asymptotically converges to a global minimum point with probability one , are given
对于有界闭集上的连续函数,利用作者给出的一种简洁的方法,证明了一类进化策略以概率为1收敛(几乎处处收敛)于优化问题的全局极小点,为进化算法的收敛性分析提供了一种新的模式。
Similar Words:
"全局呼叫模型" Chinese translation, "全局化双启发式编程" Chinese translation, "全局缓冲器" Chinese translation, "全局恢复区" Chinese translation, "全局极大值" Chinese translation, "全局极小值" Chinese translation, "全局极值" Chinese translation, "全局寄存器" Chinese translation, "全局寄存器优化" Chinese translation, "全局检索" Chinese translation