助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[161]条 当前为第1条到20条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
global optimum
    From Local Minimum to Global Optimum
    从局部极小到全局最优
    It was observed that the SCE-UA method could locate the global optimum parameter set with 100% success rate indicating that SCE-UA is capable of finding the global optimum parameter set in the automatic calibration of the Xinanjiang model.
    结果SCE-UA方法能够100%的找出全局最优参数,这表明SCE-UA方法在新安江模型的自动参数率定中能够找到全局最优参数。
    As the realization of structure risk minimization, support vector machine (SVM) has the advantages of global optimum, simple structure, and good generalization property.
    作为结构风险最小化准则的具体实现,支持向量机具有全局最优、结构简单、推广能力强等优点,近几年得到了广泛的研究。
    The mutated individual follows the advantage direction of current population, so it can jump local optimum and get the global optimum and it can avoid the semi-blind of conventional Darwinian-type evolutionary computation.
    这样,在利用优势个体确定变异方向的同时,借助劣势个体来搜索潜在的优势个体,使得个体变异既能沿着当前种群的优势方向前进,又能跳出局部最优,寻求全局最优,从而成功地克服传统达尔文演化策略的半盲目性。
    The genetic algorithms are introduced in order to get global optimum solution.
    为求得全局最优解,引进了遗传算法。
    The experiment results show that CGA can get global optimum solution more efficiently and has higher convergence rate compared with Standard Genetic Algorithm (SGA).
    实验结果表明,与标准遗传算法(SGA)相比,该算法能更有效地求得全局最优解,具有更快的收敛速度。
    SVM has good characteristics of simple structure,global optimum and strong generalization ability.
    支持向量机分类器结构简单、可获得全局最优、泛化能力强.
    In the application,the global optimum solution can be obtained and the fine plant classification can be implemented without any prior information when the proposed algorithm is applied to the push-broom hyperspectral technique imager(PHI) data.
    在应用分析中,将该算法应用于推扫式高光谱成像仪(PHI,Push-broom Hyperspectral technique Imager)数据地物分类能够获得全局最优解,在没有先验信息情况下实现地物的精细分类;
    Global Optimum Approximation of Feed Forward Artificial Neural Network for Taihu Flood Forecast
    太湖洪水预报的前向人工神经网络全局最优逼近方法
    Three-Layer Feed forward Artificial Network Global Optimum Approach
    三层前向人工神经网络全局最优逼近
    Three-Layer Feed Forward Artificial Neural Network Global Optimum Approach
    三层前向人工神经网络全局最优逼近
    Example of cross-beam shows convergence rate is rapid and continuous optimum solution approach global optimum.
    算例表明,收敛速度很快,且连续最优解接近于全局最优解。
    Case studies illustrate the design results are close to global optimum.
    实例验证所得网络设计结果更接近全局最优
    Test of functions of non-convex NLP show the hybrid algorithm has good capability in convergence speed and finding the global optimum.
    经过对非凸NLP问题的测试,表明该算法在收敛速度、以更大概率获得全局最优解方面具有良好的性能。
    Number of effective classes, average peak ratio and global optimum ratio are proposed as three performance criterions measuring class maintenance capacity, parallel local andglobal convergence velocity of niching evolutionary algorithms.
    有效类数量测度类维持能力,平均峰值比测度并行局部收敛速度,全局最优解比测度全局收敛速度。
    One of its significant advantages is having capability ofreducing the dependence of the optimal results on initial design, thus provides ameans to obtaining the global optimum.
    本文方法能基于固定网格实现双向优化的功能,其优势在于能减少最优拓扑和形状对于初始迭代点的依赖,更有利于获取全局最优解。
    Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
    三维布局问题属于组合最优化问题和NP完全问题,在一定时间内求其精确全局最优解是相当困难的。
    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.
    通过逐渐控制从混沌区域到固定点区域的分支参数,系统最终将达到全局最优解或是很高概率的近似值。
    Aimed at multiple-limit, multiple-object, non-linear, discrete of Voltage/Var optimization and control, on account of whole evolution of evolutionary programming, no demand for differentiability of optimal function, and random search, it can obtain global optimum with mayor probability, this paper solve optimal function with evolutionary programming.
    在对优化的具体实现过程中,由于进化规划着眼于整个整体的进化,对于所求解的优化问题无可微性要求,采用随机搜索技术,能以较大的概率求解全局最优解的特点,针对电压无功控制模型是一个多限制、多目标、非线性、离散的优化控制问题,因此应用进化规划算法进行模型的求解。
    We should specially point out that by the function of the mutation operator, which ensures a stable convergence of the algorithm into a global optimum.
    需要特别指出的是,通过该变异算子的作用,可以使算法稳定地收敛到全局最优解。
 

首页上一页12345下一页尾页 

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