助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   全局最优 在 数学 分类中 的翻译结果: 查询用时:1.547秒
图标索引 在分类学科中查询
所有学科
数学
自动化技术
计算机软件及计算机应用
建筑科学与工程
矿业工程
电力工业
地质学
船舶工业
工业通用技术及设备
更多类别查询

图标索引 历史查询
 

全局最优     
相关语句
  global optimization
    An Improved Genetic Algorithm for One dimensional Global Optimization problem
    一维全局最优问题的改进遗传算法
短句来源
    The hybrid genetic algorithm of Global Optimization for a Sort of Nonlinear Bilevel Mixed Integer-programming Problem
    一类非线性二层混合整数规划问题全局最优解的混合遗传算法
    A structural global optimization approach by usingpolar points in feasible regions as initial starting points
    以可行域极点为初始迭代点求结构优化全局最优
短句来源
    The Approximate Algorithm of Global Optimization for a Sort of Nonlinear Bilevel Mixed Integer-programming Problem
    一类非线性两级混合整数规划问题的全局最优解的近似算法
短句来源
    The Global Optimization for Some Classes of Programming Problems
    一些类型的数学规划问题的全局最优解(英文)
短句来源
更多       
  global optimum
    Three-Layer Feed forward Artificial Network Global Optimum Approach
    三层前向人工神经网络全局最优逼近
短句来源
    By controlling a bifurcation parameter from the chaotic dynamics regime to the fixed-point regime gradually the system may eventually reach the global optimum state or its good approximation with very high probability.
    通过逐渐控制从混沌区域到固定点区域的分支参数,系统最终将达到全局最优解或是很高概率的近似值。
短句来源
    Through compare and analysis, we get a satisfied improved hybrid Genetic Algorithm with (μ + λ) select, edge probability recombine and 2-opt local search. It can quickly converge to the global optimum solution.
    通过比较和分析得到了一种较满意的改进混合GA方案:μ+λ选择、依概率边重组交叉(依边)、变异和2-opt邻域搜索,能够较快收敛到全局最优解。
短句来源
    The three-dimensionpacking problem belongs to complex combinatorial optimization and NP-completeproblem. It is difficult to find its exact global optimum.
    三维布局问题属于复杂的组合最优化问题和NP完全问题,在一定时间内求其精确全局最优解是相当困难的。
短句来源
    Using the optimum condition and the branch-and-bound algorithm given out in reference [4], the global optimum solution of the model can be found.
    应用文献(4)给出的最优性条件及定界锥分拆算法,可求得带性能约束的矩形图元布局优化问题的全局最优解。
短句来源
更多       
  global optimal
    A Algorithm for Solving the Global Optimal Solutions of Nonlinear Programming
    求非线性规划全局最优解的一个算法
短句来源
    Necessary and sufficient condition for the global optimal solutions of nonlinear programming and its algorithm models
    非线性规划问题的全局最优解的充要条件及其算法模型
短句来源
    Global Optimal Solution to BOM Based(R,Q) Ordering Policy
    基于BOM的(R,Q)订货策略的全局最优
短句来源
    An Algorithm for Solving Bilevel Linear Programs Based on a Global Optimal Strategy
    结合全局最优策略的双层线性规划算法
短句来源
    New Algorithm on Seeking Global Optimal Solutions
    求全局最优解的新算法
短句来源
更多       
  global minimum
    In theory, the algorithm converges to the global minimum point with probability one under suitable condition.
    在理论上,证明了该算法以概率为1收敛到全局最优解。
短句来源
    We prove memory simulated annealing converge to the global minimum point with probability one under suitable condition.
    针对记忆模拟退火算法进行了收敛性分析,在较弱的条件下证明了该算法以概率1收敛到全局最优解;
短句来源
    Genetic Algorithm(for short, GA or GAs), which has a simple, all-purpose, sure character, has made great achievements in the solution to difficult, complex problems, and can convergence to the global minimum. However, random search techniques handicap convergence steep of Genetic Algorithm which likely to seek out a local optimum solution but a global sub-optimization.
    遗传算法(Genetic Algorithm,简称GA)本身所具有的简单、通用、稳健等特性使得它在困难、复杂实际问题中显示出巨大的优越性,而且能在概率意义下收敛到问题的全局最优解,但所采用的随机搜索技术却阻碍了算法的收敛速度,而且局部寻优能力差,往往只能得到全局的次优解。
短句来源
    In Part three, based on a kind of new simulated annealing, it is proved that, in theory, such algorithms asymptotically converge to the global minimum point with probability one under suitable conditions.
    第三部分,针对基于一种新解产生方法的模拟退火算法,从理论上,证明了以正态分布产生新解以及以均匀分布产生新解的模拟退火算法,以概率为1收敛到全局最优解。
短句来源
    In this paper, a new hybrid algorithm which combines the chaos optimization method and the conjugate gradient approach having an effective convergence property, is proposed. The hybrid algorithm can help the conjugate gradient approach to skip the local minimum. At the end, it can find the global minimum.
    把共轭梯度法与混沌优化方法相结合,提出了一种混合优化算法.该算法能使共轭梯度法跳出局部最优,最终获得全局最优.算法的收敛性也进行了证明,仿真表明算法是有效的.
短句来源
更多       

 

查询“全局最优”译词为其他词的双语例句

 

查询“全局最优”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  global optimization
Filled functions for unconstrained global optimization
      
The paper is concerned with the filled functions for global optimization of a continuous function of several variables.
      
To improve the efficiency of the branch-and-bound technique, some heuristic principles were proposed to cut those branches that may generate a global optimization solution with low probability.
      
On the basis of the inherent distribution within the immune response, the global optimization of the antibody was realized through parallel local optimization.
      
The possibility of using heat conductivity equation with a simple boundary layer for global optimization is investigated.
      
更多          
  global optimum
However, the current layer optimization approach to power allocation cannot achieve the global optimum of the overall system performance.
      
Basing upon the frame of multi-level optimization, the intelligent agent technique was adopted to search for global optimum.
      
After a brief introduction of the subject, the paper focusses on the first step in any optimization procedure: the delineation of the parameter space, wherein the global optimum is to be found.
      
Finding the best possible conditions (the global optimum) is very difficult for chromatographers in practice.
      
By performing a set of nine pre-planned experiments conducted over the maximum working range for the system, global optimum separation conditions could be determined.
      
更多          
  global optimal
Experimental results have shown that a global optimal solution can be quickly obtained using the proposed method and the precision requirement for target location is satisfied.
      
In addition, considering the non-convex and non-concave nature of the sub-problem of combinational optimization, the branch-and-bound technique was adopted to obtain or approximate a global optimal solution.
      
To speed up the search process and guarantee a global optimal result, the extended compact genetic algorithm (ECGA) is used to carry out the search process.
      
These schemes are based on a unified theoretical base-sufficient conditions for the global optimal known in optimal control theory.
      
2D and 3D ASMs are combined to obtain a "global optimal" segmentation of the 3D object embedded in the data set, rather than the "locally optimal" segmentation on separate slices.
      
更多          
  global minimum
Sufficient conditions of the penalty function attaining a global minimum are obtained.
      
Scanning the potential energy surface (PES) of the com plex showed that its structure corresponds to a local minimum, whereas the global minimum corresponds to the free fragments.
      
The parameters of the initial mass function (IMF) and the age corresponding to the global minimum of the deviation functional are strongly correlated with the IMF and age of the test model.
      
The region of the global minimum of the reliability factor is established for a ?111? oriented Si crystal with thickness z ranging within 200 >amp;lt; z >amp;lt; 250 ? at an energy of E = 100 keV.
      
The concept of a simplex is used, whose vertices correspond to a regular system of particles (minimum in number for a given space) in the state of the global minimum of the system's potential.
      
更多          
  其他


点击这里查询相关文摘
图标索引 相关查询

 


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

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