接下来我们提出基于调度关键路径算法。
本文分别从算法复杂度、数据结构形式及实现的容易程度等几方面分析了三种求关键路径算法的优劣。
This text has analysed three algorithms for finding the critical paths from several respects separately, such as complexity of the algorithm, the structure form of the data and easy degree.
以此模型为基础，利用改进的关键路径算法，得到网络化防空作战系统与目标对抗过程中的关键路径；
Combined with improved algorithm, the engagement critical path of networked Air Defense System with target was calculated.
论述了图论的技术以及项目管理技术，并且根据图论技术和项目管理技术设计出了关键路径算法以及网络图绘制算法。
This paper also designs the computerized critical path algorithm and the network graph drawing algorithm based on the graph theory and project management technique.
通过加权关键路径算法，可以计算工作流完成时间的期望值及记录约简过程中的中间结果，从而确定工作流模型的关键路径。
A weighted critical path algorithm was provided to calculate the expectation value of the workflow's duration, record the process of reduction, and identify the time-oriented critical path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
通过定义节点编码图概念，提出一种不需要拓扑排序的求解关键路径的新算法。
A new algorithm for finding the critical paths is proposed by using coding graph and without topological sort.
本文论述了求解主关键路径的算法。
This paper presents the algorithm of acquiring the primary critical path.
这种算法的关键是选择相干图来标识相位数据的可靠性，相位展开的路径由相干图导向。
The key of the algorithm is to point out the dependability of data by choosing coherence maps.
随后给出了SHA - 1算法模块的详细ASIC设计，优化了SHA - 1模块最长关键路径上的逻辑结构。
Then a detailed ASIC design of the SHA-1 algorithm module is given, whose logic on the longest critical path is optimized.
本文分析了GIS环境下动态路径优化算法的特点，对GIS环境下城市路网的最优路径选择问题的关键技术进行了研究和验证。
This paper analyses some characters of dynamic path optimum algorithm, studies and verifies the key techniques of the optimum path of city road network under GIS.
通过分析在数据流图(DFG)关键路径上生成PODCM的条件，给出了在DF G关键路径上生成PODCM的算法并建立了PODCM库。
After studying conditions for generating PODCM in the critical path of data flow graph (DFG), an algorithm was introduced to produce PODCM.
采用改进的提升算法，减少了关键路径上的延时。
The improved lifting scheme is adopted to reduce the critical path delay.
用前面讲过的算法，我们可以计算从这个关键点到下一个关键点最快的弧线路径。
Using the algorithm described in the preceding section, we can calculate the fastest curved path to get from the current waypoint to the next waypoint.
算法局部搜索过程中采用的基于关键路径的邻域结构缩小了问题的搜索空间。
The critical block based neighborhood structure of the problem in the local search procedure reduces the searching space of the problem and increases the probability of ants finding good solutions.
这种算法的关键是选择相干图来标识相位数据的可靠性，相位展开的路径由相干图导向。
The key of the algorithm is to point out the dependability of data by choosing coherence maps. The way for phase unwrapping is guided by coherence maps.
该算法既保证了网络区域的覆盖范围，又维持了一些路径上的关键点，以便进行路由的时候不会中断。
The scheme not only preserves the coverage of network but also key node in order not to interrupt routing.
该算法既保证了网络区域的覆盖范围，又维持了一些路径上的关键点，以便进行路由的时候不会中断。
The scheme not only preserves the coverage of network but also key node in order not to interrupt routing.
应用推荐