资源列表
Quick-Prime
- Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.-Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.
juzheng
- 为简单的矩阵相乘计算，可以实现两个矩阵相乘-Calculated as a simple matrix multiplication, matrix multiplication can be achieved two
gs
- 高斯约当法求解线性方程的C++源代码，属于数值分析课程-Gauss Jordan method for solving linear equations C++ source code, belong to numerical analysis courses
shuzu_ceshi
- 附件中提供了一种数组剔除方法，可以有效的消除数组中的冗余数据，另一方面在传感器节点选择中可以剔除已用多个节点-Annex provides an array of excluded methods, can effectively eliminate redundant data in the array, the other in the sensor node selection has been used in more than one node can be removed
wimax simulation
- WiMAX simulation code
liziqun_jiandan
- 粒子群算法的简单例子，通过这个例子可以清晰的知道粒子群算法的迭代过程-PSO simple example, through this example you can clearly know the iterative process of PSO
testcode
- This is a test code for parallel computation in fortran. Thanks
gpu_test0.cuf
- This is my parallel computation sample program in fortran. Thanks.
gpu_test1.f90
- This is my parallel computation sample program in fortran. Thanks.
Makefile
- This is my parallel computation sample program in fortran. Thanks.
README
- This is my parallel computation sample program in fortran. Thanks.
0.618
- 黄金分割法 一种计算极值的优化方法，其优点是对目标函数要求较低，无需求函数导数和输出初值-Golden section method a method of calculating extreme optimization method, the advantage is less demanding objective function, no demand and output initial value function derivative