当前位置：
首页 资源下载
搜索资源 - sieve of eratosthenes
搜索资源列表
-
0下载：
the Sieve of Eratosthenes,ancient algorithm for finding all prime numbers up to a specified integer
-
-
1下载：
对于几个流行的算法（prefix sum，matrix multiplication,Gaussian elimination,Sieve of Eratosthenes）的串行算法和openMP并行算法的代码,以及性能测试的实验报告-For several popular algorithms (prefix sum, matrix multiplication, Gaussian elimination, Sieve of Eratosthenes) of the serial algori
-
-
0下载：
A c/c++ program using threads to find prime no using sieve of eratosthenes.
-
-
0下载：
Sieve of eratosthenes used to calculate prime numbers. (a java program) that runs in the command line.
-
-
0下载：
Calculates prime numbers with use of the "Sieve of Eratosthenes".
-
-
0下载：
使用python编写的Eratosthenes筛选。-implement the Sieve of Eratosthenes using a pool of processes in Python, use test runs to see how quickly the program runs under different combinations of parameters, and write a short descr iption of your results along wit
-
-
0下载：
Java实现埃氏筛法的程序，快速求出100以内素数，适合初学者参考-Java program to achieve Erichsen Sift quickly find prime numbers less than 100, suitable for beginners reference
-
-
0下载：
Find out all the primes in set numbers, use Sieve of Eratosthenes approach.
-
-
0下载：
Sieve of Eratosthenes algorithm for finding all prime numbers up to a whole number n.
-
-
0下载：
压缩包里包含几个用C编写的并行代码，运行无误。其中包括，电路满足性的MP程序，floyd算法MPI代码，Sieve_Eratoshenes筛法MPI代码，矩阵相乘的MPI代码以及计算PI值的OpenMP代码。-Which contains several parallel programs written in C to run correctly. Among them, including Floyd algorithm procedures, matrix multiplication M
-
-
1下载：
《MPI与OpenMP并行程序设计(C语言版)》是美国Oregon州立大学的Michael J.Quinn教授在多年讲授“并行程序设计”课程的基础上编写而成的，主要介绍用C语言，并结合使用MPI和OpenMP进行并行程序设计，内容包括并行体系结构、并行算法设计、消息传递编程、Eratosthenes 筛法、Floyd 算法、性能分析、矩阵向量乘法、文档分类、蒙特卡洛法、矩阵乘法、线性方程组求解、有限差分方法、排序、快速傅立叶变换、组合搜索、共享存储编程、融合OpenMP和MPI以及5个附录。-&
-
-
0下载：
埃拉托色尼筛法（Sieve of Eratosthenes）是一种用来求所有小于N的素数的方法。从建立一个整数2~N的表着手，寻找i˂ 的整数，编程实现此算法，并讨论运算时间-The Sieve of Eratosthenes is a method for finding all primes smaller than N. From the establishment of an integer 2 ~ N of the table to start looking for i &#
-
