助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   时间复杂度和空间复杂度 的翻译结果: 查询用时:0.024秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

时间复杂度和空间复杂度
相关语句
  time and space complexity
     How to estimate the time and space complexity is described in order to optimize the performance of the software.
     如何估算时间复杂度和空间复杂度,来优化程序的性能;
短句来源
     The author analyses the time and space complexity of segmentation heap sort and compares this method with other methods of sorting.
     对分段堆排序法进行了时间复杂度和空间复杂度的分析及与其它排序方法的对比。
短句来源
     Fuzzy set theory is first applied to multicast routing algorithms and the memberships and ideal point have been defined. The models and methods of the distance from QoS parameters to ideal point have been set up which simplify multiple QoS constraints into single distance one. An algorithm MQMRFI has been designed and implemented and both its time and space complexity are analyzed.
     首次将模糊集理论应用到组播路由算法中,定义了各个QoS参数的隶属度和理想点,建立了计算各个QoS参数到理想点距离的模型和方法,将多QoS约束简化为单距离约束,设计和实现了MQMRFI算法,分析了该算法的时间复杂度和空间复杂度,仿真结果证明在CPU执行时间上优于传统的QoS组播路由算法。
短句来源
     CTBAR improves the efficiency of data mining by combining the two(methods:) reducing the time and space complexity,ensuring the correctness of the mined results. Several experiments assess the relative performance of the algorithm in comparison with the Apriori and its(extended) algorithm.
     此算法通过结合Apriori和FP-tree两种算法来提高挖掘效率,降低了挖掘算法的时间复杂度和空间复杂度.
短句来源
     In order to cut down the time and space complexity of the attribution reduction algorithm based on modificatory discernibility matrix,firstly,we gave the definition of simple discernibility matrix,and proved the simple discernibility matrix contains the same information content as the modificatory discernibility matrix.
     为降低基于修正差别矩阵的属性约简算法的时间复杂度和空间复杂度,首先给出了简化差别矩阵的定义,并证明了该矩阵所包含的信息量与修正差别矩阵的信息量等价.
短句来源
更多       
  “时间复杂度和空间复杂度”译为未确定词的双语例句
     On this condition,a complete attribution reduction algorithm is designed,time complexity and space complexity of the new algorithm are cut down to max{O(|C|2(|U′pos‖U/C|)),O(|C‖U|)}and max{O(|U|),O(|C|(|U′pos‖U/C|))} respectively.
     在此基础上设计了一个完备属性约简算法,其时间复杂度和空间复杂度分别被降为max{O(|C|2(|U′pos‖U/C|)),O(|C‖U|)}和max{O(|U|),O(|C|(|U′pos‖U/C|))}。
短句来源
     On the foundation,a new computing core algorithm is designed,and the time complexity and space complexity of the new algorithm are cut down max{O(CU/C■),O(CU)} and max{O(U),O(CU/C■)} respectively.
     在此基础上设计了一个新的求核算法,使得新算法的时间复杂度和空间复杂度分别被降为max{O(CU/C2),O(CU)}和max{O(U),O(CU/C2)}。
短句来源
     The time complexity and space complexity of the algorithm are all analyzed as O(n*N~2).
     分析得出该算法的时间复杂度和空间复杂度均为O(n*N2).
短句来源
     It took O(N) time and O(N) space to deal with the text or string of length N.
     对于长度为N的文本,算法的时间复杂度和空间复杂度均为O(N)。
短句来源
     In addition, the author verifies the correction of the algorithm theoretically and experimentally, and analyzes the time complexity and the space complexity, points out the worst time complexity is (max(e+n㏒+k ,n2)) and the worst space complexity is (kn2), which are polynomial solutions and indicate the algorithm is effective.
     从理论和实验上验证了算法的正确性,并分析了算法的最坏时间复杂度和空间复杂度,其最坏时间复杂度为(max(e+n㏒+k ,n2)),最坏空间复杂度为( kn2),它们均为多项式解,表明算法也是有效的。
短句来源
更多       
  相似匹配句对
     The space complexity is O(1),and the time complexity is O(n). [
     该算法的空间复杂度O(1) ,时间复杂度为O(n) .
短句来源
     The spatial complexity is always O(n) for all cases.
     其空间复杂度都是O(n) .
短句来源
     The author defines it as consciousness of sex, time and space, and hardships;
     时间空间意识;
短句来源
     Its timing complexity is 0(n2).
     其时间复杂度为O(n2)。
短句来源
     All these make the algorithm more efficient. The space complexity of the algorithm is O(N).
     该算法的空间复杂度为O(N);
短句来源
查询“时间复杂度和空间复杂度”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  time and space complexity
Time and space complexity bounds related to the parameters of the problem are derived.
      
The estimates of the time and space complexity are related to the parameters of the problem.
      
The estimates of the time and space complexity are related to the parameters of the problem.
      
Estimates for the time and space complexity of the algorithm as a function of problem parameters are given.
      
The time and space complexity of the class of languages generated in linear time by context-sensitive grammars is investigated.
      
更多          


The concepts of modified graphs of a composite graph with respect to two vertex-pairs and a hyperedge-decomposition are introduced. By using these concepts and the directed hypergraph theory, the topological formulae for the parameter-extraction theorem and subnetwork-extraction theorems are derived, then the topological formulae for multiterminal feedback networks are presented. In these formulae the parameters of the feedback subnetwork are separated from that of the fundamental subnetwork, so that it is convenient...

The concepts of modified graphs of a composite graph with respect to two vertex-pairs and a hyperedge-decomposition are introduced. By using these concepts and the directed hypergraph theory, the topological formulae for the parameter-extraction theorem and subnetwork-extraction theorems are derived, then the topological formulae for multiterminal feedback networks are presented. In these formulae the parameters of the feedback subnetwork are separated from that of the fundamental subnetwork, so that it is convenient to find out the effect of the feedback parameters. Furthermore, since one network is decomposed into, two smaller subnetworks, the computing time complexity and space complexity can be reduced-

本文提出了混合图关于二点对和超边分解的变形图的概念,应用它们和有向超图理论导出了参数抽取定理和子网络抽取定理的拓扑公式,进而导出了多端反馈有源网络的拓扑公式。公式中反馈子网络与基本子网络的参数是分开的,便于看出反馈参数的影响;而且由于把一个网络分解成二个较小的子网络,可以降低计算的时间复杂度和空间复杂度

Getting the depth of binary tree has various solution. Based on the cosideration of view of the time complexity and space complexity for algorithms, two non-recursive algrithms for getting the depth of binary tree are obtained by tracing the top pointer of stack and level traversal.

二叉树深度求解是一个有多解的问题,从算法的时间复杂度和空间复杂度着眼,采用追踪栈顶指针,层次遍历的两种算法实现二叉树深度的求解,并对算法进行了分析和比较.

This paper is based on the characteristic of existing city traffic map. It presents a new algorithm to seek the best path rapidly. The experimental results also demonstrate that this algorithm reduces time complexity and space complexity.

根据现有城市交通图的性质,提出了一种新的快速查找最优路径的算法.实验表明,这种算法降低了时间复杂度和空间复杂度

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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