助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   new heuristic algorithm 在 数学 分类中 的翻译结果: 查询用时:0.079秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
自动化技术
电信技术
机械工业
工业经济
宏观经济管理与可持续发展
更多类别查询

图标索引 历史查询
 

new heuristic algorithm
相关语句
  新的启发式算法
    Mathematical Model for Bus Scheduling Problem And Its New Heuristic Algorithm
    客车调度问题(BSP)的数学模型及一种新的启发式算法
短句来源
    The paper concerns a new heuristic algorithm for linear multiple-objective programs with 0-1 variables. The algorithm improves the coefficient limitation in old algorithm with new role and assessment standard,which will be suitable for any 0-1 linear multiple -objective programming especially for large scaleplanning.
    提出了一个0-1线性目标规划新的启发式算法.该算法以新的算法准则及评价标准,改进了旧算法中的系数限制,并能通用于任何0-1线性目标规划问题,特别能够有效地解决大规模0-1线性目标规划问题.
短句来源
    A new heuristic algorithm(H1) is used to produce initial upper bound of the Lagrangian relaxation of the capacity constraints of CSLLSP.
    对能力约束进行松驰后的Lagrangian问题的求解 ,构造了新的启发式算法 ;
短句来源
    In this paper we first summarize the exist heuristic algorithms for flow shop problem which the objective is minimize makespan and then on the basis of NEH algorithm, we propose a new heuristic algorithm for flow shop to minimize the makespan.
    对该问题有很多求解目标 ,如最小加工周期 ( min makespan) ,工件的最小平均在系统的停留时间 ( min mean flow tim e)等 . 本文以求解最小加工周期为目标 ,基于目前已知的性能最好的算法 NEH算法的基本思想 ,提出了一种新的启发式算法 -组合指标算法 .
短句来源
  “new heuristic algorithm”译为未确定词的双语例句
    A New Heuristic Algorithm for Vehicle Routing Problem
    运输路径问题的一个新启发式算法
短句来源
    The key point of the system is cutting stock optimization module in which the new heuristic algorithm is used.
    其中的关键技术是棒材的下料优化,将基于启发式多级序列线性优化思想的新算法应用到下料优化模块中。
短句来源
    Based on rough sets, a new heuristic algorithm is presented to solve the difficulty.
    基于粗集理论 ,本文提出了一种新的决策表最优特征子集选择的启发式算法 .
短句来源
    An Optimal Direction and a New Heuristic Algorithm for Quadratic Network Programming
    二次网络规划基解的一个优化方向及算法
短句来源
    The computational example shows that,the new heuristic algorithm get better performance and has a higher convergence speed comparing with the monolithic method.
    最后通过算例试验表明,这种启发式算法与采用整体求解方法相比,具有比较满意的寻优性能和收敛速度。
短句来源
查询“new heuristic algorithm”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  new heuristic algorithm
This article proposes a new heuristic algorithm, called Shared Multi-sub-backup-paths Reprovisioning (SMR), to improve the survivability for multi-link failures in WDM mesh networks.
      
By discrete-event simulation we compare various routing strategies in terms of blocking probability and we propose a new heuristic algorithm based on an occupancy cost function which takes several possible causes of blocking into account.
      
In addition the new heuristic algorithm for solving a bimatrix game problem is investigated.
      
This paper presents a new heuristic algorithm for designing least-cost telecommunications networks to carry cell site traffic to wireless switches while meeting survivability, capacity, and technical compatibility constraints.
      
In this paper, wegive examples of applications of this problem and propose for thegeneral case a new heuristic algorithm and an exactalgorithm.
      
更多          


Flowshop scheduling with the objective of minimizing mean completion time has been proved to be NP hard. The paper presents two methods,branch and bound to guarantee optimal solution and heuristic algorithm to achieve near optimal solution. Computer simulation shows that the new heuristic algorithm performs well and it is easy for computer implementation.

流水车间以极小化平均完工时间为目标的排序问题已被证明为NP难题,本文给出了求解该问题的两种方法;求最优解的分枝定界法和求近化解的启发式算法.大量计算机模拟结果表明,本文给出的启发式算法优度较高,而且是简单的多项式算法.

A new heuristic algorithm for learning from positive examples is presented. Compared with other existing learning methods from examples, the proposed algorithm is based on deductive reasoning, so it can be applied to precise knowledge acquisition and to multiple valued minimization. Furthermore the algorithm is simple, fast and easy to implement.

本文提出一个启发式示例学习算法.同现存的示例学习方法相比,本文算法是基于演绎推理的.并且不需要提供反例集.本文算法对给定的正例集进行演绎学习以获取具有保真性的概念规则.本文算法也适用于多值逻辑函数的极小化.

In order to increase the throughout in process of memory manufacture, or solve the problem of fault tolerance in parallel array, common approach is spare allocation. The problem can be described as bipartite cover whose complex is NP hard. Heuristic algorithms are usually adopted to speed up feasible cover search. In this paper, a new heuristic algorithm is proposed where scatter degree is employed and complex of the algorithm is reduced to O(n). Based on it, another principle named relationless-seperatation...

In order to increase the throughout in process of memory manufacture, or solve the problem of fault tolerance in parallel array, common approach is spare allocation. The problem can be described as bipartite cover whose complex is NP hard. Heuristic algorithms are usually adopted to speed up feasible cover search. In this paper, a new heuristic algorithm is proposed where scatter degree is employed and complex of the algorithm is reduced to O(n). Based on it, another principle named relationless-seperatation of bipartite graph is proposed in this paper. Under this principle, we can disolve any bipartite graph into some relationless bipartite graph, so the complecx is reduced consequently.

为了解决大容量存贮器制造过程中因各种原因造成的成品率低的问题,或并行阵列中的容错重组问题,一般采用冗余修复的方法.该问题一般被归结为双向图的覆盖问题,且其复杂度被证明为NP.为加快求解速度,可以采用启发式算法求解.本文提出一种新的启发式算法求解,可以降低该问题的复杂度,提高修复效率.

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

 


 
CNKI小工具
在英文学术搜索中查有关new heuristic algorithm的内容
在知识搜索中查有关new heuristic algorithm的内容
在数字搜索中查有关new heuristic algorithm的内容
在概念知识元中查有关new heuristic algorithm的内容
在学术趋势中查有关new heuristic algorithm的内容
 
 

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