助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   全局极值 的翻译结果: 查询用时:0.94秒
图标索引 在分类学科中查询
所有学科
地质学
地球物理学
矿业工程
数学
更多类别查询

图标索引 历史查询
 

全局极值     
相关语句
  global extremum
     Homotopic neural optimizationtheory and its algorithm described in this paper can make nonlinear multiextremalobject functions converge fast to global extremum, so it is an effective inversionmethod.
     本文提出的同伦神经优化理论(HNOT)及其算法(HNOA)能将非线性多极值目标函数较快地收敛于全局极值,是一种有效的反演方法。
短句来源
     The low discrepancy of quasi_random sequence ensures that the function field be searched evenly and various local extrema including global extremum be found.
     同时 ,拟随机序列的低偏差性保证了函数定义域能够被均匀地搜索 ,为找到多个局部极值包括全局极值提供了保证 .
短句来源
     ②The global optimal solution can be uniquely obtained because there is only one global extremum in the training process.
     ②整个训练过程中有且仅有一个全局极值点,确定了预测的稳定性。
短句来源
  global extreme value
     The other is that it enlarges or shrinks fitness value properly,which,combined with random rule,determines a certain particle as global extreme value in speed update formula.
     适当地缩放适应值,与随机规则共同决定某个粒子作为速度公式中的全局极值
短句来源
  global extreme
     The characteristics of the optimization method based on the approximation technology, the traditional gradient-based search algorithm and the standard genetic algorithm are studied, through calculating global extreme of two test functions and re-constructing the geometry of airfoil.
     通过计算两个测试函数的全局极值以及翼型几何形状的重构,比较了基于Kriging模型的优化方法与传统的梯度类优化方法、标准遗传算法的特点。
短句来源
     The other is that it enlarges or shrinks fitness value properly,which,combined with random rule,determines a certain particle as global extreme value in speed update formula.
     适当地缩放适应值,与随机规则共同决定某个粒子作为速度公式中的全局极值
短句来源
  “全局极值”译为未确定词的双语例句
     Visualization of Valley-peak Method
     求解函数全局极值谷峰法的可视化
短句来源
     In this paper,a new theorem of global maximum and global minimum on finite dimensional Hilbert space was proposed and some applications were presented.
     本文在有限维Hilbert空间上改进了全局极值定理并给出了改进后定理的某些应用.
短句来源
     The reference frames to be estimated are analyzed first, the vectors accumulation algorithm is proposed based on the hypothesis that the error plane is monotone around the global match point in a small scale.
     算法对帧间估计的基准进行了分析,考虑到差错平面在全局极值点的小范围附近满足单调性条件是可能的这一假设,提出了帧间矢量叠加法,以较小的搜索范围获得了更好的估计结果;
短句来源
     And the global best and personal best of particle swarm algorithm are selected by the grey relevancy theory. Further more,the grey particle swarm algorithm is presented for multi-objective models solution in the reliability robust optimization design.
     运用灰色理论中的关联分析法,选取粒子群算法中的全局极值和个体极值,提出了适合可靠性稳健优化设计中多目标模型求解的灰色粒子群算法。
短句来源
     The mutation operator was introduced by control model of discrete traffic signal to update the best point of the individual and the best point of the global in adaptive-Mutation particle swarm optimization algorithm (AMPSOA).
     离散交通信号控制模型在自适应粒子群算法中引入变异算子,以更新粒子群算法的个体极值点和全局极值点。
短句来源
更多       
查询“全局极值”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  global extremum
The global extremum (minimum) of this dependence, which was accepted as the goal function, was used as a criterion for designing the algorithm optimizing the gripper position on the load axis upon stabilizing the angular motion of the module.
      
Computer experiment demonstrated, however, that the iterative procedure stabilized after several steps, although the global extremum was not necessarily attained.
      
An effective method for finding the global extremum in identifying a logical-probabilistic risk model within reasonable computation time is developed.
      
Determination of the Nash-equilibria in the bimatrix game was considered by reducing it to its equivalent nonconvex problem of optimization solved by the algorithm of global search based on the theory of global extremum for this problem.
      
Parallelization of the global extremum searching process
      
更多          
  global extrema
It has not been adopted widely, partly because it requires global extrema, and not local and this has been regarded as a problem with no solution.
      
Conditions for coincidence of local and global extrema in optimization problems
      
Conditions for the coincidence of local and global extrema in problems of discrete optimization
      
This article presents a new algorithm, called the''Hyperbell Algorithm'', that searches for the global extrema ofnumerical functions of numerical variables.
      
Results show that if the global extrema of the nonconvex quadratic function are located on the boundary of the primal feasible space, the dual solutions should be interior points of the dual feasible set, which can be solved by deterministic methods.
      
更多          
  global extreme
The genetic algorithm is then employed to find out the global extreme solution of the cost function.
      
The genetic algorithm is then employed to find out the global extreme solution for the cost function.
      
Besides, the genetic algorithm will converge to global extreme instead of local extreme and achieves a good antenna pattern.
      


Finding coverage with minimum cost is an important step in logic minimization. Since it is a Np-complete problem, it is not practical for large input data. In this article, we use a stochastic neural network to find the optimal coverage through formalizing the coverage problem; choosing appropriate annealing schedule and parameters. The algorithm we use has low time and space complexity, and has high parallelism.

寻找最小代价覆盖是逻辑最小化中的一个重要步骤.由于这是一个NP完全问题,对较大量数据寻找最佳覆盖不实际.本文利用一个随机并行算法,通过将覆盖问题公式化来寻找一个代价函数的全局极值.选择适当的退火策略与参数值即可以得到最佳覆盖结果.所用算法具有较低的时间和空间复杂性,并有高度的并行性.

This correspondence states the criterion of cluster validity problem which injects validity measurement functionals into the final judgement i such as fuzzy partition coefficient and entropy.It involves the optimizing of validity functionals through the implementation of FCM algorithm to evaluate optimal clustering.In this way,a unique global minimum can be guaranteed for validity functional over fuzzy c-partition space.A clustering experiment for recognition of an ambiguous photograph of MIG- 29 fighter taken...

This correspondence states the criterion of cluster validity problem which injects validity measurement functionals into the final judgement i such as fuzzy partition coefficient and entropy.It involves the optimizing of validity functionals through the implementation of FCM algorithm to evaluate optimal clustering.In this way,a unique global minimum can be guaranteed for validity functional over fuzzy c-partition space.A clustering experiment for recognition of an ambiguous photograph of MIG- 29 fighter taken by a spy satellite is successfully developed by computer simulation.

本文分别以模糊分类系数和分类熵为聚类有效性的测度函数,采用模糊C均值分类法,求最优的测度函数值所代表的全局极值的那种分类。确定为最佳分类方式;并对一张由卫星拍摄的地面MIG-29型飞机照片进行了成功的分类试验。

There are some problems in VLSI layout that can be dealt with by combinatorial optimization; many among them are NP-complete problems. Using traditional algorithms. such as itcrative impproving,branch and bound, divide and conquer, we obtain too frequently only local minima. In this paper, we use a stochastic parallel algorithm to obtain optimal coveragein logic minimization which is a NP-complete problem in VLS layout. In implementing such an algorithm, careful consideration is given by the authors to the following...

There are some problems in VLSI layout that can be dealt with by combinatorial optimization; many among them are NP-complete problems. Using traditional algorithms. such as itcrative impproving,branch and bound, divide and conquer, we obtain too frequently only local minima. In this paper, we use a stochastic parallel algorithm to obtain optimal coveragein logic minimization which is a NP-complete problem in VLS layout. In implementing such an algorithm, careful consideration is given by the authors to the following three aspects: construction of objective functions. rule of choice of parameters, and choice of annealing schedule. We have used the algorithm to solve other VLSI layout problems,such as: circuit partition, assignment problem in gate array layout,gate sequencing in gate matrix layout and placement of blocks in building block layout. The results we obtain show that the algorithm bas low time complexity and low spare complexity with high parallelism and also that it is a good way to solve YLSI layout problems. It will be more effective if running on parallel computers.

在VLSI布图中,有许多可以归结为组合优化的问题,用传统方法解决这类问题时,很容易陷入局部极值.利用一种随机并行算法-Alopex算法,通过将VLSI布图中的一些问题公式化,并选择适当的退火策略和参数值来寻找一个代价函数的全局极值以得到最佳结果.通过实例进行了验证,得到了比较好的结果.

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关全局极值的内容
在知识搜索中查有关全局极值的内容
在数字搜索中查有关全局极值的内容
在概念知识元中查有关全局极值的内容
在学术趋势中查有关全局极值的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社