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

图标索引 历史查询
 

全局最优
相关语句
  global optimization
    Simulated annealing(SA)algorithms are random search techniques based on physical annealing process, which can prevent the optimizing process into local optimization and get the global optimization.
    模拟退火算法是模拟物理退火过程的一种随机优化搜索算法。 算法以优化过程的求解与物理退火过程的相似性为基础,通过接受准则和对下降温度的控制,能够有效的克服优化过程陷入局部极小从而获得全局最优解。
短句来源
    Results show that multi method collaborative optimization algorithm based on embedding collaboration obtains better global optimization performance than single optimization method.
    进行遗传算法、模式搜索法和Powell法嵌入协作组成的多方法协作优化方法设计。 计算实例表明 ,基于嵌入协作的多方法协作优化方法取得了优于单个优化方法的全局最优特性。
短句来源
    Genetic algorithm is proposed to optimize the model and to get global optimization.
    遗传算法的使用优化了局部相似模板生成过程,得到全局最优解。
短句来源
    New method of global optimization solving multi-dimensional problems
    解决多维全局最优问题的一种新方法
短句来源
    A chaotic search method for global optimization on tent map
    一种基于帐篷映射的混沌搜索全局最优方法
短句来源
更多       
  global optimum
    Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
    三维布局问题属于组合最优化问题和NP完全问题,在一定时间内求其精确全局最优解是相当困难的。
短句来源
    The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
    理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
短句来源
    This research attemptsto solve the discrete VAR optimization problem based onsuch a technique that a Genetic Algorithm (GA) isemployed to find out an approximation solution near tothe global optimum.
    用传统的优化算法已无法保证得到全局最优解,为了寻找靠近全局最优解,本文试图应用基于遗传算法(GA)技术求解离散无功优化问题,遗传算法是基于自然选择和自然生物学的随机查寻算法,该算法在随机的条件下试验偶然的新部分,但不是简单的任意查寻,它有希望改进性能并有效地利用系统信息去怀疑新查寻点。
短句来源
    By using more superior algorithm of interchange insertion method the Travel Salesman Problem is solved simply and directly. The idea that is easier to find out the global optimum solution by the way of seeking out the partial optimum solution from solution groups is put forward.
    分析货郎担问题的解空间,用简捷的交换插入算法求解货郎担问题,并提出用求多个局部最优解的方法,然后再从中得出全局最优
短句来源
    Usually, the algorithm can quickly converge to the global optimum weight coefficients.
    该方法对目标函数无连续、可微等要求,能较快地收敛到全局最优权系数。
短句来源
更多       
  “全局最优”译为未确定词的双语例句
    PSO being iterations random algorithm does better in fast constringency and finding the optimization solution with biggish probability.
    PSO算法本质上属于迭代的随机搜索算法,其主要优点在于收敛速度快、能以较大的概率找到优化问题的全局最优解等。
短句来源
    However, signals take effect by the switch of signal phases, which introduces integer control values into the traffic control problem, so the traffic control problem becomes a large-scale mixed integer programming problem, the computation of which requires an exponential-complexity optimization algorithm.
    基于模型的控制算法的控制效果虽然受到交通模型预测精度的影响,但对于交通系统这样的复杂大系统,具有一定精度的模型对系统状态进行预测并对控制作用进行评价,仍是获得系统全局最优控制策略的重要途径。
短句来源
    The model employs the Gradient Descent optimization algorithm as parameters learning to refine fuzzy if-then rules, and a system parameter is used to adjust a trade-off between the interpretability and the correct classification percentages, so that the model has good interpretability and learning capability.
    支持向量机是统计学习理论的一种具体实现方法,它具有稀疏性表示、良好的泛化能力和全局最优解等特性,从而在很大程度上解决了模式识别领域中的一些根本问题,如模型选择与过学习问题、非线性与维数灾难问题以及局部极小问题等。 因此,统计学习理论和SVM成为近年来机器学习领域的研究热点。
短句来源
    With the definition of a new matching dissimilarity measure, an objective function of clustering algorithm is developed by modifying the common cost function, i.e., the trace of the within cluster dispersion matrix, which is suitable for analysis of data sets with mixed attributes. The genetic algorithms (GA) is employed to optimize the developed objective function for overcoming the drawback of the traditional fuzzy k-means (FKM) algorithm, i.e., sensitivity to the initialization.
    1.定义了一个新的相异性匹配测度,修正了传统聚类算法的目标函数——类散布矩阵的迹,将数据集中不同属性特征相结合,构成新的聚类目标函数,使得其能够适合混合类属特征的数据,并利用遗传算法对其进行优化,克服传统的模糊κ-均值(FKM)算法对原型初始化敏感的缺点,使得算法能够以较高的概率收敛到全局最优解。
短句来源
    Specifically, it does well on a test suite of highly fragmented and cluttered data, symmetric object models, and multiple model instances.
    子集收敛法是贪婪搜索的一个变种,相对于其它算法,获得全局最优匹配的概率更高,尤其是在图像特征高度断裂、物体模型对称,以及图像上存在多个对象实例的情况下,效果尤其突出。
短句来源
更多       
查询“全局最优”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  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.
      
更多          


In connection with the specific features of the application of complex method to the optimum design in engineering structures, a complex method with "layered" iteration taking the iteration number as the control parameter is proposed. Compared with the standard algorithm of complex method, the method here proposed has the advantages of asking for fewer iterations, having higher speed of convergence and being capable of giving an optimum solution of the whole.

本文针对复合形法在工程结构优化设计中应用的特点,提出以迭代次数作为控制参数的分层复合形迭代法,与复合形的标准算法相比,该方法迭代次数少,收敛速度快,且能够得到全局最优解.

An expert system for long-distance truck transport dispatching is presented. In accordance with the experience of dispatchers, the transportation business of the day is divided into subsets. No-load optimum algorithm is then used to arrange the best transportation routes for the subsets. With the local solutions found for the subsets, optimum global solution is obtained. By the system proposed it is possible to improve the mileage utilization of long-distance truck transportation.

本文描述了一个汽车运输调度专家系统,该系统根据调度员的经验,将当天的运输业务划分成子业务集,用空载最优算法确定子业务集中的最佳运输路线,得到局部解,再由局部解求得全局最优解,达到提高长途汽车运输的里程利用率的目的。

This paper introduces and analyses a kind of new heuristic optimization method——simulated annealing algorithm. It is a general random search algorithm based on Monte-Carlo iterative improvement method. The paper gives a sufficient condition for the convergence of simulated annealing algorithm; analyses the main parameters of the algorithm; and discusses its various applications, such as computer design, image processing, and neural net computation, etc.

本文分析和介绍了一种新的通用启发式优化方法——模拟退火算法,它是基于Monte-Carlo迭代求精法的一种随机搜索算法。本文给出了模拟退火算法收敛到全局最优值的一个充分条件;分析了算法的三个重要参数;并介绍了模拟退火算法在超大规模集成电路(VLSI)设计、图象处理和神经网计算机等方面的应用。

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

 


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

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