 全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多   both algorithm 的翻译结果: 查询用时：0.162秒 在分类学科中查询 所有学科 更多类别查询 历史查询  both algorithm 求导算法(1)  求导算法
 Based on the definition of derivative,the both algorithm on Numerical value derivative are investigated,general program to calculate derivative of aleatoric function is designed,and point out that precision can be raised if along exponent curve approaching zero. 基于导数的定义 ,研究了 2个求导算法 ,设计了计算任意函数导数的通用程序 ,并指出了沿指数曲线逼近 0点可以有效提高计算精度 短句来源 “both algorithm”译为未确定词的双语例句
 Both algorithm of maximum-likelihood and least squares are applied to the 512 FK4/FK4 sup. stars selected by Fricke 最后,给出了对512颗FK4/FK4sup恒星自行资料的归算结果。 短句来源 The experiments on simulated data show that the GA-EM algorithm maintains the monotonic convergence property of the EM algorithm, taking on a good robustness to initial values of parameters: 1) we have obtained a better MDL score while using exactly the same termination condition for both algorithm. 数值实验也表明，GA_EM算法不仅继承了EM算法的单调收敛性，对模型参数初始值也更加稳健：1)在同样的迭代终止条件下，GA_EM算法能够得到比EM算法更好的MDL值。 短句来源 The method proves simple, handy, fast, common and convenientfor both algorithm and proofreading. 通过实践证明，此快速输入方法具有实现算法简便、灵活、快速、通用、校核方便等优点。 短句来源 Among the fifteen candidates of AES Conference Round II, MARS, RC6? Rijn-dael,Serpent and TwoFish won the NIST's praise by their excellent characteristics in both algorithm and implement. 通过了AES第2轮选拔的MARS、RC6~(TM)、Rijndael、Serpent、TwoFish5种加密算法,每种算法各有千秋。 短句来源 The complexity concept including both algorithm complexity and incomputable complexity is presented. 提出涵盖可计算复杂性和不可计算复杂性的复杂性概念； 短句来源 更多 相似匹配句对
 Both G. G. 短句来源 Both T. Tulipanum的T. 短句来源 The algorithm is both scalable and parallel. 该算法既是可伸缩的，也可并行化。 短句来源 in the algorithm; 算法简单易行。 短句来源 This algorithm is both simple and effective. 这种算法简单高效并在不断的搜集过程中增量学习,使其在系统运行一段时间后表现出较好的稳定性。 短句来源 查询“both algorithm”译词为用户自定义的双语例句

我想查看译文中含有：的双语例句  both algorithm
 Another issue that is shared by both algorithm types is thefunctional relation between the BER and the SIR. Parallelism has been exploited on both algorithm and architecture levels. Both algorithm and subroutine are general in their capabilities and can be used, for example, to determine the area of a spherical polygon containing one or more holes. With MPEG4 Codec implementation as the example, we have deployed design techniques from both algorithm level and architecture level optimizations. The ratings distribution of items and users also may affect both algorithm and evaluation metric choice. 更多 Recently Lu Sheng-xun has shown how a modified Wang Product can be used to generate all the Hamiltonian cycles in a plane graph with considerably less computation than previously reported. In this paper, Lu' s algorithm is generalized to nonplanar graphs and named the cycle-algorithm. The dual one called the cut-algorithm is also proposed. It can be used in arbitrary graphs, too. Either of the algorithms is explained in detail by way of an example. Two theorems are derived in which these... Recently Lu Sheng-xun has shown how a modified Wang Product can be used to generate all the Hamiltonian cycles in a plane graph with considerably less computation than previously reported. In this paper, Lu' s algorithm is generalized to nonplanar graphs and named the cycle-algorithm. The dual one called the cut-algorithm is also proposed. It can be used in arbitrary graphs, too. Either of the algorithms is explained in detail by way of an example. Two theorems are derived in which these algorithms have been proved. Both algorithms can be used for finding all of Hamiltonian paths contained in arbitrary graphs. The cut-algorithm has been carried out on the computer Type 719. According to the results from the computer' s calculation, the number of all Hamiltonian cycles in a certain maximum planar graph with nine vertices should be 112, instead of 96 or 110 given by other authors previously. 本文提出的两种算法,可用来发生任意图的全部哈密顿圈。算法以特定约束下的王氏积为基础。另外还推导了两个定理,证明了该算法的正确性。算法Ⅱ已在719型计算机上实现。文末还介绍了一些计算结果。 In sorting methods both algorithms of list sorting are discribed in this paper i. e. list insertion algorithm, list merge algorithm and thief programs. According to the three principles of evaluating sorting algorithm, they are analysed and compared with between. In the paper the methods of computation are abstracted and some tables are given so as to evaluate thier sorting effect intuitively. 本文阐述了分类算法中列表分类的两种算法:列表插入算法和列表归并算法及程序。根据衡量分类算法的三个准则,对这两种算法作了比较和分析。特别对分类效能的分析,文中提出了一种计算和估算法,并列出了一些表格,从而可以直观地评价其分类效能。 One of the fundamental problems in linear time-invariant multivariable system theory is to obtain minimum realization from a given transfer matrix. In this paper, Rosenbrock's algorithm for minimum realization is improved to reduce the order of the matrix polynomials of the transfer function matrix and to reduce the computing time. As the minimum realization so obtained is not in canonical form, the authors attempt to develop another algorithm to transform the first one into Luenberger's canonical... One of the fundamental problems in linear time-invariant multivariable system theory is to obtain minimum realization from a given transfer matrix. In this paper, Rosenbrock's algorithm for minimum realization is improved to reduce the order of the matrix polynomials of the transfer function matrix and to reduce the computing time. As the minimum realization so obtained is not in canonical form, the authors attempt to develop another algorithm to transform the first one into Luenberger's canonical form. Both algorithms are tested on DJS-130 computer. 在研究线性时不变多变量系统时,由已知的传递函数G(s)求得其最小实现是线性系统理论的基本问题之—.六十年代以来已发表了一些论文.本文的一个内容是改进Rosenbrock的最小实现算法,以降低运算时矩阵的阶数和减少运算工作量.又由于Rosenbrock的最小实现算法所得到的不是标准形,所以本文的另一个内容是对获得Luenberger标准形提出一种算法. << 更多相关文摘 相关查询

 CNKI小工具 在英文学术搜索中查有关both algorithm的内容 在知识搜索中查有关both algorithm的内容 在数字搜索中查有关both algorithm的内容 在概念知识元中查有关both algorithm的内容 在学术趋势中查有关both algorithm的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索 2008 CNKI－中国知网 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社