Cyclomatic complexity, pioneered during those studies I previously mentioned, precisely measures path complexity.
圈复杂度是在我前面提到的那些研究期间开创的，它可以精确地测量路径复杂度。
Several main considered parameters are average link clustering, number of multiple paths, path complexity factor, and hop difference factor.
几个考虑的主要参数有平均链路簇，多径数目，路径复杂度和跳数差别因子。
EESSPA algorithm can avoid the information explosion by distributed control. Its computation complexity is independent of the number of hops along the path.
EESSPA算法的特点是采用分布式控制，避免了由于集中式控制导致的信息爆炸，并且算法复杂度与途经链路数无关。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
Structure coverage testing technology and program complexity is discussed, and the code coverage technology based on decision to decision path (DD-path) is studied.
讨论了结构覆盖测试技术和程序复杂度，研究了基于决策到决策路径(DD -路径)的代码覆盖技术。
It's well known that underwater acoustic channel is a coherent multi-path channel, which brings difficulties in signal processing because of the complexity of the received signal sequence.
众所周知，水下声信道是相干多途信道，信号在信道中的多径传播使得接收信号序列复杂化，因而极大地增加了信号处理的难度。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
It greatly simplified Settings and implementation, with cost and complexity reduced, and opened a new path for order analysis. However, the researches are just in the preliminary stage and immature.
在国内外首次实现了无需鉴相装置的阶比跟踪，在安装和实现上大大简化，降低了阶比分析的使用成本和复杂性，开辟了阶比分析技术的新途径。
Meanwhile, combining these two ideas, we propose a new kind of single-source shortest path algorithm based on bucket structure, which has good time complexity and parallelism property.
同时，提出了结合这两类算法思想的一种基于桶结构的单源最短路径串行算法，算法具有好的运行时间复杂度和可并行性。
The path-dependent characteristic of American option results in it's pricing complexity and causes the pricing differences from American call option and put option.
美式期权的路径依赖特征导致了其定价的复杂性，并使得美式看涨、看跌期权之间的定价原理差异较大。
But complexity makes it hard to mark a path of action for everyone who CARES - and that makes it hard for their caring to matter.
但是事务的复杂性使得为那些真正关注的人引出一条行动之路很困难，于是使得要让他们的同情心发挥作用变得很困难。
The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
For the diversity and complexity of the environment, path planning has being an important aspect in the mobile robotic research field and also a crucial technology to intelligentize the robot.
机器人运动环境的多变性和复杂性，决定了移动机器人路径规划问题是机器人领域一个研究重点，也是机器人实现智能化的关键技术。
So their computability complexity is low and speed is quick. Experiment is important for the study of path planning to validate the performances of algorithms and to make comparisons.
在路径规划算法的研究中实验具有重要的作用一般用来验证算法在实际环境下的各种性能并可用于对不同算法进行性能比较。
The reason of complexity of HIS had been analyzed so that we can offer thinking path to which scientific, reasonable, comprehensive and maneuverability index system.
本研究对造成H IS评价复杂性的主要原因作了分析，以期为设计科学、合理、全面、操作性强的HIS综合绩效评价指标体系提供思路。
Solving the first k out of a short path algorithm, and other short-path k-solving algorithm, this algorithm has better time and space complexity.
出了一个求解第k短路径的算法 ，和其它 求解第k短路径 的 算法相比，本算法具有较好的时间和空间复杂度。
Experimental results show that the path feasibility analysis of traditional symbolic evaluation can be omitted. So it can reduce the time complexity by using symbolic execution algorithm.
实例结果表明，该算法能免去传统符号执行中对于路径可行性的分析，从而降低时间复杂度。
To the computation time end, a new quick-sort-like path construction method is proposed, which have smaller computation complexity;
在减少计算时间方面：提出了一种减少时空复杂度的类似快速排序的周游方案；
To the computation time end, a new quick-sort-like path construction method is proposed, which have smaller computation complexity;
在减少计算时间方面：提出了一种减少时空复杂度的类似快速排序的周游方案；
应用推荐