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

图标索引 历史查询
 

计算时间复杂度     
相关语句
  computing time complexity
     The computing time complexity is O(men1).
     计算时间复杂度是O(men_l);
短句来源
     At the same time, scheduling restrict conditions of original RM algorithm was analyzed and the shortcoming of computing time complexity was pointed out.
     同时,分析了以往调度算法中单调比率调度算法约束条件, 并指明了计算时间复杂度的缺点。
短句来源
  “计算时间复杂度”译为未确定词的双语例句
     Comparing with the algorithms of Hoschek,Carlos and Piegl in some examples,it is validated that this method can cut down iteration times about 10%~90%,reduce time consumption around 20%~70%,or improve precision nearly 40%.
     与Hoschek,Carlos以及P iegl等算法的拟合结果比较表明,该算法迭代次数减少了10%~90%,计算时间复杂度降低了20%~70%,计算精确度提高了40%左右。
短句来源
     Its resulting expressions are very compact, and its computinp time complexity is O(ve∑nl).
     它的表达式很紧凑,计算时间复杂度为O(ve∑n_1)。
短句来源
     (2) An improved Sarsa(λ) algorithm was advanced after making a thorough analysis on trace eligibility, with time complexity 0(|A|) per update.
     (2) 对标准Sarsa(λ)算法中的资格迹进行了深入分析,得到一个改善的Sarsa(λ)算法,它的计算时间复杂度为D(|A|),在此基础上设计了一个启发式回报函数,得到了一个带有启发式回报函数的Sarsa(λ)算法。
短句来源
     All of the numerical analysis is based on the Runge-Kutta method of 4,5 step algorithm, the algorithm can guarantee a certain accuracy, but without affecting the temporal complication and spatial complication in computations.
     所有数值实验均是基于Matlab的龙格—库塔(Runge-Kutta)4,5阶算法进行的,此算法既可保证一定的计算精度,又不影响计算时间复杂度和空间复杂度。
短句来源
     Since the detection is carried out on DC sequence, the computation complexity of this method is relatively low.
     由于检测对DC序列进行,算法计算时间复杂度比较低。
短句来源
更多       
  相似匹配句对
     The computing time complexity is O(men1).
     计算时间复杂度是O(men_l);
短句来源
     A d-Complexity of Sequences
     序列的d-复杂度
短句来源
     ×N)for N th order code generator with M taps.
     ×N)的复杂度
短句来源
     (2) computational time;
     (2 )计算时间 ;
短句来源
     Its resulting expressions are very compact, and its computinp time complexity is O(ve∑nl).
     它的表达式很紧凑,计算时间复杂度为O(ve∑n_1)。
短句来源
查询“计算时间复杂度”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  computing complexity
This algorithm is provided with a sound theoretic basis, and its computing complexity is relatively lower and not strongly dependent on the data length.
      
However, some redundant and irrelevant attributes, which result in low performance and high computing complexity, are included in the very large database in general.
      
This attack solves the tradeoff between the length of the keystream and the computing complexity needed to recover the secret key.
      
This algorithm produces rational, robust results while reducing computing complexity.
      
However, the computing complexity of the second stage is higher than that of the first stage, thus the three-stage algorithm is a preferred choice unless the frequency uncertainty is small.
      
更多          
  complexity of computing
On asymptotic complexity of computing discrete logarithms over GF(p)
      
The complexity of recurring sequences over finite sets is estimated as the complexity of computing on determinate linearly bounded automata.
      
The complexity of branching recurring sequences over finite sets is estimated as the complexity of computing on non-determinate linearly bounded automata.
      
The complexity of computing a correlation function is significantly reduced accordingly.
      
Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a sequential LP process, and derive a general relationship between the size of a characterization set and the complexity of computing the nucleolus.
      
更多          
  computing time complexity
Furthermore, since one network is decomposed into two smaller subnetworks, the computing time complexity and space complexity can be reduced.
      
Its advantages are smaller computational effort (its computing time complexity isO (eni), wheree is the number of edges andni is the number of leaves) and shorter resulting expression.
      


The concept and Algorithm SSTDKTP of the state space tree T of the directed ?tree polynomial P On, ....., FK) of a composite graph G are introduced. Then a new algorithm- Algorithm DKTPCG is presented for the direct generation of P(tF1, FK) using branch-and-bound method. The algorithm is simple, and the resulting expression is very com pact. The computing time complexity is O(men1). The space complexity is O[(n-k)(ke+ n)] for stacks and O(ndf) for output arrays XE, YE, FL and NS, where n, and ndf, are the numbers...

The concept and Algorithm SSTDKTP of the state space tree T of the directed ?tree polynomial P On, ....., FK) of a composite graph G are introduced. Then a new algorithm- Algorithm DKTPCG is presented for the direct generation of P(tF1, FK) using branch-and-bound method. The algorithm is simple, and the resulting expression is very com pact. The computing time complexity is O(men1). The space complexity is O[(n-k)(ke+ n)] for stacks and O(ndf) for output arrays XE, YE, FL and NS, where n, and ndf, are the numbers of leaf and state nodes of T, respectively.

引入了混合图G的有向K树多项式P(t_(F_1),……F_K)的状态空间树T的概念和算法SSTDKTP。提出了用分支-定界法产生P(t_(F_1),……,F_K)的一个新算法——算法DKTPCG。该算法简单,所得表达式十分紧凑。计算时间复杂度是O(men_l);空间复杂度对于堆栈是O[(n-k)(ke+n)],对于输出数组XE,YE,FL和NS是O(n_(df)),这里n_l和n_(df)分别是T的叶点和状态节点的数目。

The concepts of complete hypertree and primary subhypergraph are introduced, and a new method--primary subhypergaph mathod is presented for generating symbolic network functions. It is an improvement of primary subgraph method. Its resulting expressions are very compact, and its computinp time complexity is O(ve∑nl). In general, the total number of leaves ∑nl is far less than the numberof primary subgraphs np, hence its computation -efficiency is higher than that of primary subgraph method.

文中引入完全超树和主子超图的概念,并提出产生线性有源网络之符号网络函数的一个新方法——主子超图法。它是主子图法的改进。它的表达式很紧凑,计算时间复杂度为O(ve∑n_1)。通常叶总数∑n_1远小于主子图数n_p,所以它的计算效率高于主子图法。

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-

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

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

 


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

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