首页 | 本学科首页 官方微博 | 高级检索

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 收费全文 6篇 完全免费 9篇
 自动化技术 15篇
 2012年 1篇 2009年 1篇 2008年 1篇 2007年 2篇 2006年 3篇 2003年 2篇 2002年 1篇 2001年 1篇 2000年 1篇 1997年 1篇 1992年 1篇

1.

2.

3.

4.

5.

6.

7.

8.
Computing products of large numbers has always been a challenging task in the field of computing. One such example would be the factorial function. Several methods have been implemented to compute this function including naive product, recursive product, Boiten split, and prime factorization, and linear difference. The method presented here is unique in the sense that it exploits finite order differences to reduce the number of multiplications necessary to compute the factorial. The differences generated are regrouped into a new sequence of numbers, which have at most half as many elements of the original sequence. When the terms of this new sequence are multiplied together, the factorial value is obtained. The cardinality of the new sequence can further be reduced by partitioning. The sequence is computed by using several difference tables that assist in establishing the pattern that determines the sequence. An analysis of the algorithm is presented. The analysis shows that the execution time can be reduced significantly by the algorithm presented.  相似文献
9.
ＨＰＦ（ＨｉｇｈＰｅｒｆｏｒｍａｎｃｅＦｏｒｔｒａｎ）是基于数据划分说明的并行语言。如何由数据划分确定程序的计算划分是ＨＰＦ编译器需要首先解决的基本问题。本文介绍了ＨＰＦ的数据划分和计算划分的概念。以三层嵌套循环为例，直观地提出了一种求得计算划分的算法  相似文献
10.