Chinese translation for "局部最小值"

local minimum

Related Translations:

最小:  minimum◇最小半径 least radius; 最小公倍数 lowest common multiple (lcm); least common multiple

局部:  part (in a contrast to the whole); locality; topo- 短语和例子局部服从全局。 the part must be subordinated to the whole. 两国之间的边界争论, 比起两国的悠久友谊来说, 是一个暂时性和局部性的问题。 compared with the long-standing friendshi

Example Sentences:

	1.	These three local minima differ by virtue of whether the resulting vacuum energy is positive , negative or zero 我们可以使用真空能量是正、负或零，来区分这三个局部最小值。
	2.	The supervised training alleviates over - matching , reduces the possibility of being locked into a local - minimum area and shortens the convergence period 采用监督式训练方法，对过拟合有较好的抑制作用，使其不易陷入局部最小值，加快了收敛速度。
	3.	Based on the present control experience , let the boiler operate on a sub - optimal status first , and then seek out the better . in this way , the problem of local minimum can be avoided effectively while optimizing 根据现有控制经验，让锅炉先进入次优态运行，再进一步寻优，能有效避免最优化中的局部最小值问题。
	4.	Aim at bp arithmetic shortcoming of tend plunging local minimum value , applied amelioration inherit arithmetic in taking object as the approach of searching information to overcome local convergence of nn 针对bp算法具有易于陷入局部最小值的缺点，应用改进遗传算法直接以目标函数值作为搜索信息途径，克服神经网络的局部收敛的缺陷。
	5.	The constraints described are a bit like one might find in a " random walk " algorithm , with the end condition resembling a " statisficing " or " local minimum " result - but certainly the requirements are simpler than most real - world ones 上述的约束有点象可以在“随机遍历”算法找到的约束，结束条件类似“统计”或“局部最小值”结果但当然，这要比大多数现实世界中简单。
	6.	Because ga possesses the traits of can global random search , the robustness is strong , been use briefly and broadly , it didn ’ t use path search , and use probability search , didn ’ t care inherence rule of problem itself , can search the global optimum points effectively and rapidly in great vector space of complicated , many peak values , cannot differentiable . so it can offset the shortages of nn study algorithm , can reduce the possibility that the minimum value get into local greatly , the speed of convergence can improve , interpolation time shorten greatly , the quantity of training reduce 因为遗传算法具有全局随机搜索能力,鲁棒性强、使用简单和广泛的特点,它不采用路径搜索,而采用概率搜索,不用关心问题本身的内在规律,能够在复杂的、多峰值的、不可微的大矢量空间中迅速有效地寻找到全局最优解,所以可以弥补神经网络学习算法的不足,使陷入局部最小值的可能性大大减少,使得收敛速度提高,训练量减小。
	7.	Since these theoretical analyses are based on inviscid potential flow theory , theoretical calculation and computational simulation may complement each other . the hydrodynamics and undulating propulsion of specimens were studied using three dimensional computational fluid dynamics ( cfd ) modeling . the cfd analysis using kinematic model of undulatory dorsal / median fin draws a series of conclusions , which include that the body drag increases significantly with the lateral body oscillation ; the body drag is minimum while the start point of 计算结果表明游动过程中的形体阻力随侧向周期性摆动而增大;当背鳍前端位于身体侧向最宽处时,形体阻力具有局部最小值,结论与实验观测结果相吻合;在实验观测的典型运动参数下,波动面的运动方程中的非对称因素的出现使推进力增大约1 . 10倍。
	8.	Motivated by the practical requirements of robot path planning , a generalized constrained optimization problem gcop with not only logic and but also logic or relationships was proposed and a mathematical solution developed previously . this paper inherits the fundamental ideas of inequality and optimization techniques from the previous work , converts the obstacle avoidance problem into a semi - infinite constrained optimization problem with the help of the mathematical transformation , and proposes a direct path planning approach without cspace calculation , which is quite different from traditional methods . to show its merits , simulation results in 3d space have been presented 他们在早期的系列研究中： 1提出了更一般的非线性优化问题generalized constrained optimization problem ,简称gcop ，即约束间的逻辑关系不但有“与and ”的关系，而且还有“或or ”的关系，并给出了在实际应用中可行的数学求解方法2利用了计算机图形学中的constructive solid geometry csg方法来构建障碍物的不等式表述3将计算机cad中的插值方法与优化理论结合半无穷维优化，克服了路径规划问题中的局部最小值问题。
	9.	This paper use techniques of linear windows , differential operator , min operator , fuzzy - mathematics and mathematical morphology to complete the precise orientation of license plate , and use horizontal projection and local - least value techniques to complete the segmented of the characters , and the artificial neural network technology is applied to complete the character recognition 本文应用线窗口、差分算子、 min算子、模糊数学、数学形态学等技术手段完成了车牌的精确定位，应用水平投影、局部最小值等方法完成了车牌字符的分割，应用神经网络感知机等技术解决了字符识别的问题，开发出实用的算法。
	10.	As a straightforward method , the full search algorithm ( fs ) is widely used because of its high performance . usually , fs is computationally expensive in a video encoder . as a result , in order to reduce the heavy computational load of fs , active research has focused on fast bmas for a long time and several sub - optimal search algorithms for block - based motion estimation have been developed . these include : three step search ( tss ) , four step search ( fss ) , two - d logarithmic search , orthogonal search , cross search , etc 目前块匹配运动估计算法有很多，如全搜索法、三步法、共轭方向搜索法、二维对数搜索法、交叉搜索法、钻石搜索法以及四步搜索法等，它们各有优缺点，全搜索法精度高，但计算量大，三步搜索法和交叉搜索法搜索速度较快，但搜索误差较大，容易陷入局部最小值。

Similar Words：

"局部组织死亡" Chinese translation, "局部组织学" Chinese translation, "局部最大模原理" Chinese translation, "局部最大值" Chinese translation, "局部最适宜椭球体" Chinese translation, "局部最优" Chinese translation, "局部最优方案" Chinese translation, "局部最优化 局部最优化" Chinese translation, "局部最优较正" Chinese translation, "局部最优解" Chinese translation