助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   时间复杂性 的翻译结果: 查询用时:1.654秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
数学
自动化技术
互联网技术
电信技术
教育理论与教育管理
更多类别查询

图标索引 历史查询
 

时间复杂性     
相关语句
  time complexity
     In this paper we give an efficient algorithm for determing the intersection of all minimal coverings in a bipartite graph G,the time complexity of which is O(max {|V(G)|~(1/2),|E(G)|,|V(G)|~2}).
     本文给出了一个求二分图G所有最小复盖的交的好算法,其时间复杂性为O(max{|V(G)|~(1/2)。|E(G)|,|V(G)|~2})。
短句来源
     In this paper we give an efficient algorithm for determing the intersection of all minimal coverings in a bipartite graph G, the time complexity of which is O(max {|V(G)|~(1/2),|E(G)|,|V(G)~2}).
     本文给出了一个求二分图G所有最小复盖的交的好算法,其时间复杂性为O(max{|V(G))|~(1/2)。|E(G)|,|V(G)|~2})。
短句来源
     For any given problem with A(1),A(2),…,A(n-1),A(n),and M, the time complexity of the algorithm is O(n~~(log_2(M+1)+1))and the space complexity is O(n), where A(1),A(2),…,A(n-1),A(n),and M are all positive integers.
     设给定的n个正整数为A(1),A(2),…,A(n-1),A(n),给定的子集和为正整数M,算法的时间复杂性为O(nlog2(M+1)+1),空间复杂性为O(n)。
短句来源
     Our algorithm has time complexity of O(nm2).
     本算法时间复杂性为O(nm2).
短句来源
     Then it is proved that the time complexity of OCS is O(3n) , but experimentally it is already close to O(2 3n?2 ).
     接着证明了OCS算法的时间复杂性为O(3n),但在实验上已经接近O(23n/2).
短句来源
更多       
  time-complexity
     New Time-Complexity Analysis of the Quick-Sorting Algorithm
     快速排序算法的时间复杂性的新分析
短句来源
     In 1984, a young indian scholar, N. Karmarkar, found a new interiorpoint algorithm for linear programming problems min{cтx|Ax≥b, x≥0}. The time-complexity of the algorithm is O (n3.бL2).
     对于线性规划问题 min{cтx|Ax≥b,x≥0},印度学者 и.Karmarkar于 1984年发明 了一种新的内点算法,它的时间复杂性为O(n3.5L2),其中n为问题的变量个数,L为输 入中的二进制位数。
短句来源
     But because of the much information involved in timetabling, and the time-complexity to get the optimal solution of timetabling is the index magnitude of the scale of timetabling, so for the problem of timetabling of certain scale, the ones that were generally adopted are the algorithms that got the better solutions.
     但由于排课表问题所涉及的信息较多,并且求解排课表问题最佳解的时间复杂性是课程表规模的指数级,所以对于有一定规模的排课表问题,一般采用的都是求较佳解的算法。
短句来源
     The results show that the LIF can eliminate memory-space-cluster and reduce time-complexity in the join operation and can smooth the bottleneck of the join operation in the relational database system, so that the RDBP can achieve better performance in the join operation.
     结果表明,RDBP在LIF的支持下可以获得较好的联接操作特性:消除了联接操作中的存储空间“聚集性”和降低联接操作的时间复杂性。 有效地“平滑”了联接操作的性能瓶颈。
短句来源
     This paper proposes a rule of the asymptotic time-complexity analysis and average capability ones.
     作者在算法分析中,提出了渐近时间复杂性分析、时间复杂性平均性能分析的准则。
短句来源
  computation time complexity
     If we use FFT , their computation time complexity are all O(n_1n_2 log_2 n_1n_2).
     若用快速富里叶变换(FFT)计算,这些算法的时间复杂性均为O(n1n2log2n1n2).
短句来源
     It also proves that the computation time complexity is O(n log \-2n ) for calculating one radical similar matrix and O(n2\+n ) for calculating all radical similar matrices.
     计算全部同型平方根矩阵的时间复杂性为 O(n2 n) .
短句来源
     It can prove that the computation time complexity is O(nlog2n) for calculating one mth root of r-circulant matrix and which is O(nmn) for calculating all by using FFT.
     计算全部平方根矩阵的时间复杂性为O(nmn)。
短句来源
  time complexities
     The time complexity of the former is O(n), but the time complexities of the latter two are O(n~2) and lower than O(2~nn~2) respectively.
     前者的时间复杂性为O(n),而后者的时间复杂性分别是O(n2)及低于O(2nn2).
短句来源
     By studying the structure of 16 dimension Barnes-Wall lattice and lattices resulting from binary linear block codes and quaternary linear block codes based on Construction A, decoding problem of the lattices can be transformed into the problem of finding the shortest path of trellises accordingly. The time complexities of the decoding algorithms are analyzed.
     本文通过研究16维Barnes-Wall格和基于构造A的二元线性分组码、四元线性分组码的导出格的代数结构,将这些格的译码问题转化为在相应码的格图上求最短路径的问题,从而提出了这些格的快速译码算法,并分析了译码算法的时间复杂性
短句来源
     The architecture of the system and its key algorithms were given. Time complexities of the algorithms were analyzed. The time complexity of the retrieval algorithm is 0(log 2M).
     论文给出了这个系统的体系结构和系统的核心算法 ,进行了算法复杂性分析 ,检索算法的时间复杂性为 0 (log2 M)。
短句来源
     In this paper, author have introduced an algorithm computing minimum free energy of the RNA secondary structure to find the RNA secondary structure having minimum free energy. The time complexities of this algorithm is not more than O(n4).
     本文以寻找最小自由能二级结构为目的,给出了RNA二级结构的最小自由能算法,该算法的时间复杂性不超过O(n~4)。
短句来源
     It is proved in detail that the time complexities of the algorithm is O(NlbN), where N is the sum of the number of points and the number of line-segment endpoints within the point-line set.
     证明了算法的时间复杂性为O(NlbN),其中N是点线集中点的数目与线段端点数之和.
短句来源

 

查询“时间复杂性”译词为其他词的双语例句

 

查询“时间复杂性”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  time complexity
It is shown how the behavior of a system with a sparse spectrum up to time T=(1-ρ)/14ε can be predicted on a quantum computer with the time complexity t=4/(1-ρ)ε1 plus the time of classical algorithm, where ρ is the fidelity.
      
We examine the conditions under which resources compositions with required properties exist and estimate asymptotic time complexity of the corresponding algorithms.
      
The time complexity of the algorithm is O(mn2 + m7/2).
      
Two approximation algorithms are suggested, and the bounds for the relative error and time complexity are obtained.
      
Based on these results, the testing algorithm polynomial-time complexity for legal firing sequence is proposed.
      
更多          
  time-complexity
In the process, we develop a hierarchy of time-complexity classes based on the Ackermann function.
      
If the users are asynchronous, the optimum multiuser detector can be implemented by a Viterbi algorithm whose time-complexity is linear in the number of symbols transmitted by each user and exponential in the number of users.
      
In order to achieve a good time-complexity for such an algorithm employing the divide-and-conquer paradigm, it is necessary to find an ambitus quickly.
      
The total time-complexity of our algorithm for the Euclidean bottleneck matching problem isO(n2 +n1.5 log0.5n).
      
The polynomial time-complexity of linear programming had just been established.
      
更多          
  computation time complexity
After justifying the convergence of the Discrete Legendre Transform to the Legendre-Fenchel transform, an extended computation time complexity analysis is given and confirmed by numerical tests.
      
Its worst case computation time complexity is the same as that of the Dijkstra algorithm, i.e., O(?V?2), where ?V? is the number of nodes in the network.
      
Also, Table 1 shows the computation time complexity of the above mentioned techniques.
      
  time complexities
Theoretical and experimental spatial and time complexities of the developed algorithm are presented.
      
Compared with related works, the algorithms presented in the paper are efficient, and the time complexities of these algorithms are polynomial.
      
We describe a detailed empirical study of their time complexities with respect to comparable pairs of terms.
      
The time complexities of the algorithms are shown to be θ (n) for polygons and θ (n logn) for two- and three-dimensional point sets.
      
Empirical results are used to compare the time complexities of the algorithms for different classes of regions.
      
更多          
  其他


点击这里查询相关文摘
图标索引 相关查询

 


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

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