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

 算法复杂性 的翻译结果: 查询用时：1.64秒
 历史查询

 算法复杂性
 algorithm complexity
 THE ALGORITHM COMPLEXITY OF TRANSFORMING EULERIAN TOUR T INTO T' BY K_1-TRANSFORMATION 欧拉游历间K_1-变换下的算法复杂性 短句来源 AN ALGORITHM FOR SOLVING TRAVELLING SALESMAN PROBLEM BASED ON SORTING(1): ALGORITHM PRINCIPLE AND ESTIMATION ON ALGORITHM COMPLEXITY 一种基于排序的旅行售货员问题算法──（Ⅰ）算法原理与算法复杂性估计 短句来源 The algorithm complexity of RS decoding finally is analyzed. 最后分析了RS码译码的算法复杂性。 短句来源 Discussion about Algorithm Complexity of the Internal Sorting 内分类算法复杂性的讨论 短句来源 (2)The formulas characterizing algorithm complexity are given so as to discuss the simplification effect. (2)给出了表征算法复杂性的公式,讨论了简化效果。 短句来源 更多
 complexity of algorithm
 The method is feasible because it only changes inner product operation and the complexity of algorithm doesn't increase. 因为升维后只是改变了内积运算 ,并没有使算法复杂性随着维数的增加而增加 ,因此这种方法才是可行的。 短句来源 One class of new reliability preserving reduction Wstone bridge reduction and a class of networks namely WST networks are presented. The networks is an extension to S P networks . Based on this ,we give a new linear time algorithm for computing K terminal reliability of this class networks, the complexity of algorithm is O(|E| 2). 给出了一类新的可靠性保护缩减—桥缩减和一类无向网络 ,称之为 WST网络 ,该类网络是对串并联网络的扩展并且对该类网络提出了一个计算 K—终点可靠性的线性时间算法 ,其算法复杂性为 O(|E|2 ) . 短句来源 The basic goal of 3D modeling is to generate virtual object of third dimension which can compare beauty with real one through acceptable complexity of algorithm. 3D造型的基本目标就是在可接受的算法复杂性下,生成真实感可以与实物媲美的虚拟物体。 短句来源 The Complexity of Algorithm About Newton and Predictor Iteration 牛顿迭代与预测式迭代的算法复杂性 短句来源 From the point of view of the computability theory,the paper expounds mathematical background for public key cryptosystem including the relationship between the complexity of algorithm and problem,the length of key,and security of cryptogram. 从计算理论的角度阐述了公钥密码体制的数学背景,即算法复杂性与问题复杂性,密钥长度与密码安全的关系; 短句来源 更多
 algorithmic complexity
 By using the time scanning of the algorithmic complexity value C(n) and earthquake intensity factor value Mf the study on 12 moderate earthquakes occurred in Henan province and its neighboring region has been carried out. 采用“八五”地震预报攻关研究成果──地震算法复杂性C（n）值及地震强度因子Mf值时间扫描，对河南及邻区12次中等以上地震进行单项和综合分析研究。 短句来源 CHARACTERISTICS OF SEISMICITY EVOLUTION REVEALED BY ALGORITHMIC COMPLEXITY 用算法复杂性分析地震活动演化特征 短句来源 Many worthwhile optimization problems are NP-hard in algorithmic complexity,one of the solutions of which is approximation algorithm. 许多有着重要理论和应用价值的最优化问题在算法复杂性上都是NP-hard的,其解决方法之一是近似算法。 短句来源 STUDIES OF ALGORITHMIC COMPLEXITY AND EARTHQUAKE PREDICTION IN 11 SEISMIC ZONES OF SICHUAN AND YUNNAN AREAS 算法复杂性与川滇地区11个地震带(区)地震预报的研究 短句来源 AN IMPROVEMENT ON THE DEFINITION OF ALGORITHMIC COMPLEXITY 算法复杂性定义的改进 短句来源 更多
 computational complexity
 1. Analysis of the MUD problem in CDMA communication systems, coming out from the theory of computational complexity. 1、首先，分析了CDMA通信系统中多用户检测问题，从算法复杂性的角度认识CDMA通信中的多用户检测方法。 短句来源 This paper studies the computational complexity of this problem, and obtains the following results: For any given integer k, 2≤k≤∞. the (k,2) path chromatic number problem for graphs and the (k,3) path chromatic number problem for graphs with diameter 2 are NP-complete ; 称该问题为图的（k，r）路色数问题．本文研究其算法复杂性，并得到以下结果：对于任意给定的k，2≤k≤∞，图的（k，2）路色数问题及直径为2的图的（k，3）路色数问题都是NP－完全的； 短句来源 And gives the algorithm describes and the computational complexity analyses for them. 并给出算法描述和算法复杂性分析。 短句来源 The analysis of computational complexity indicates that the efficient suitable range of the piecewise elimination algorithm is wide. 算法复杂性分析表明,分段消元法的有效适用范围很广。 短句来源 In most case, the performance of the new method is similar to those of MUSIC method, but the new method has smaller computational complexity and easier for parallel implementation. 这种方法在多数情况下性能与MUSIC方法相近,而运算量和算法复杂性却大大降低。 短句来源 更多

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

 algorithm complexity
 The simulation results based on a simplified traffic model show that the proposed algorithm guarantees better performances of efficiency and fairness than conventional algorithms, without increasing the algorithm complexity. The algorithm complexity is the cost of a particular algorithm. Functions of binary trees and their applications in algorithm complexity analysis We describe several systems in each of these areas, focusing both on progress within the field, and the costs, benefits and interactions among different problem and algorithm complexity limitations used in the surveyed work. The algorithm complexity and the tradeoffs for implementation are extensively discussed. 更多
 complexity of algorithm
 The computational complexity of Algorithm A is of orderO(2ck), wherek denotes the length of the LFSR andc>amp;lt;1 depends on the input parameters of the attack, and Algorithm B is polynomial (in fact, even linear) in the lengthk of the LFSR. A remark on complexity of Algorithm 1 is given below. CPU overhead depends on the complexity of algorithm and data structure. For the time complexity of algorithm MFTB, we have the following theorem. In summary, the complexity of algorithm elim-bel is dominated by the time and space needed to process a bucket. 更多
 algorithmic complexity
 Results about algorithmic complexity of various problems related to the generation of formal concepts, hypotheses, classifications, and implications. The combination of the two blocks to form a unified block (modified controller) permits reducing the computational and the algorithmic complexity of processing the measurable information. Algorithmic Complexity of a Problem of Idempotent Convex Geometry This statement is an analog of the author's result about the algorithmic complexity of sets obtained as values of propositional formulas, which was published previously. This statement is an analog of the author's result about the algorithmic complexity of sets obtained as values of propositional formulas, which was published previously. 更多
 computational complexity
 Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. Computational complexity of (2,2) path chromatic number problem The algorithm exhibits either a solution or its nonexistence after at most, steps (where n is the dimension of the problem) and the computational complexity is at most1/3n3 + O(n2) This paper studies the computational complexity of this problem for graphs with small diameters. However, its computational complexity was comparable to that of the normalized least-mean-square (NLMS) algorithm. 更多
其他
 点击这里查询相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关算法复杂性的内容 在知识搜索中查有关算法复杂性的内容 在数字搜索中查有关算法复杂性的内容 在概念知识元中查有关算法复杂性的内容 在学术趋势中查有关算法复杂性的内容

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

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