搜索资源列表
exp1
- 给定正整数n，计算出n个元素的集合{1, 2, , n}可以划分成多少个不同的非空子集。-Given positive integer n, to calculate a collection of n elements (1, 2, , n) can be divided into a number of different nonempty sets.
parallel
- 一个并行粗糙集离散化算法，采用VC和MPI并行开发通信接口实现，目前速度最快的离散化算法。-A parallel algorithm for discretization of rough sets, using VC, and MPI parallel development of communication interfaces, the fastest of the discrete algorithm.
AES
- 一个并行粗糙集离散化算法，采用VC和MPI并行开发通信接口实现，目前速度最快的离散化算法。-A parallel algorithm for discretization of rough sets, using VC, and MPI parallel development of communication interfaces, the fastest of the discrete algorithm.
MP_PageRank
- 利用mapreduce编程思想，个人编写的网页排名算法，绝对可用。若果想要在集群上运行，可能需要对于数据集格式做调整。-Mapreduce programming ideas, personal written page rank algorithm is absolutely available. If you want to run on a cluster, you may need to adjust the format of the data sets.
BigNumber
- 输入数据有若干组数据，每组数据由一个运算符（+、-、*、/、 ）和两个整数构成，如果运算符遇到‘@’,则表示运行结束。-There are a number of input data sets of data, each set of data by an operator (+,-,*, /, ), and two integers, if the operator encounters ' @' , it means the end of the run.