全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 multistage graph 的翻译结果: 查询用时：0.169秒
 在分类学科中查询 所有学科 计算机软件及计算机应用 更多类别查询

 历史查询

 multistage graph 多段图(7)
 多段图
 Algorithm of the Time-constrained Multistage Graph Problem 基于带时间约束的多段图问题的回溯算法 短句来源 Algorithm for Drawing Multistage Graph 一个多段图的画图算法 短句来源 This is to say, according to the flowing situation of water flow, this paper sums up its features and simitrdes compared with multistage graph problem, then defines a special water and gives another algorithm. 也即是根据水流在水槽中的流动情况,归纳出其特点,将其与多段图的特点进行对比分析,得出相同点,然后利用其性质定义了一种特定性质的水流,提出了多段图问题的另一种解法。 短句来源 Another Solution to Multistage Graph Problem Based on Water Channel Principium 基于水槽原理的多段图问题的另一种解法 短句来源 software engineering management is a problem of making decisions in each phase serially, has the character of multistage graph problem in dynamic planning algorithm. 它是一个多阶段决策问题,具有动态规划算法中多段图的特点。 短句来源 更多
 “multistage graph”译为未确定词的双语例句
 Determining the H Property of A Graph by Changing It into Multistage Graph 用转换成多级图的方法判定图的H性质 短句来源 The main idea is to transform the graph into a multistage graph firstly,! and after that, to determine if there exist a simple path(refer to the context) in the graph we got. 思想是先将简单无向图转换成多级图,然后证明简单无向图中哈密顿回路存在性与多级图中简单路径(定义见正文)存在性的等价性,最后通过多级图中简单路径存在性的判定实现简单无向图H性质判定。 短句来源
 相似匹配句对
 Algorithm for Drawing Multistage Graph 一个多段图的画图算法 短句来源 [s,t]-GRAPH [s,t]-图及其Hamilton性 短句来源 Algorithm of the Time-constrained Multistage Graph Problem 基于带时间约束的多段图问题的回溯算法 短句来源 Graph Theory. Graph Theory。 短句来源

我想查看译文中含有：的双语例句

 multistage graph
 monadic-serial dynamic programming problem can be solved as the search of an optimal path in a multistage graph and can be computed as a string of matrix multiplications. For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph.
 A algorithm for drawing multistage graph with time complexity O(n+e) is presented.In addition to drawing multistage graph,this algorithm can be used to draw trees,bipartite graphs and the graphs of other special types. 给出了一个时间复杂度为Ｏ（ｎ＋ｅ）的多段图的画图算法．该算法除了可以用来画多段图外，也可以用来画树、二分图等其它特殊类型的图． ：The time-constrained multistage graph problem is one spread out from the multistage graph problem．In this paper the means of expression of recursion set and the backtrace technique are introduced into the path selection in the time-constrained multistage graph，by which the minimum cost for the tourist path is worked out through calculation in a given time． 基于带时间约束的多段图问题是多段图问题的自然扩展。该文带时间约束的多段图的路径选择，引入了递归集合的表示方法和回溯技术，在给定时间条件下计算出了最小成本的旅游路径。 No matter theoretical research or practical application have both made great achievementsfor software engineering, gradually formed three key factors: methods, tools and management. However these three key factors have developed unparallel. Compared to methods and tools, the theoretical research or practical application of management lagged. It becomes a critical influence factor in the development of software engineering. The essential characters of software engineering management is that how to optimally allocate... No matter theoretical research or practical application have both made great achievementsfor software engineering, gradually formed three key factors: methods, tools and management. However these three key factors have developed unparallel. Compared to methods and tools, the theoretical research or practical application of management lagged. It becomes a critical influence factor in the development of software engineering. The essential characters of software engineering management is that how to optimally allocate capitals, time, labors to each phase in the life cycle of software engineering so as to obtain high quality software. software engineering management is a problem of making decisions in each phase serially, has the character of multistage graph problem in dynamic planning algorithm. As a result, dynamic planning algorithm is applied in software engineering management in this paper. 软件工程学科在理论研究和实践应用中都取得了巨大成就,逐渐形成了方法、工具和管理三大要素。然而,这三要素的发展是不均衡的,相对于方法和工具,管理的理论研究和科学应用都显得滞后,已经成为软件工程学科发展的瓶颈问题。软件工程管理的本质是如何在软件工程生命周期的各个阶段最佳地配置人员、资金和时间三种资源,以取得软件质量最优化。它是一个多阶段决策问题,具有动态规划算法中多段图的特点。文中将动态规划算法应用到软件工程管理的决策之中。 << 更多相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社