-
用C++做的一个关于N！的运算的求法。给学习C++的朋友一个示例。...
用C++做的一个关于N！的运算的求法。给学习C++的朋友一个示例。-With C++ Done on the N! Method of computing. To learn C++ Friends an example.
- 2022-12-29 20:20:03下载
- 积分：1
-
图的操作,实现遍历功能
图的操作,实现遍历功能-operation of the plan, to achieve functional Traversing
- 2022-10-06 07:25:03下载
- 积分：1
-
adasdasdasd
- 2022-07-26 00:54:54下载
- 积分：1
-
a number of procedures, pyramid schemes and from matches, such as the N
有多个程序, 传销, 取火柴, 二的N次方等-a number of procedures, pyramid schemes and from matches, such as the N-th
- 2022-05-08 21:05:46下载
- 积分：1
-
任意进制间（2
任意进制间（2-16）转换计算程序！-between arbitrary bases (2-16) conversion program!
- 2022-02-09 17:40:45下载
- 积分：1
-
本程序为7HC595的驱动程序，为初学者掌握SPI时序给予很大帮助。...
本程序为7HC595的驱动程序，为初学者掌握SPI时序给予很大帮助。-This procedure for 7HC595 driver, SPI master timing for beginners to give great help to me.
- 2022-06-16 19:20:53下载
- 积分：1
-
研究生算法作业分支界限法求解货郎担问题
研究生算法作业分支界限法求解货郎担问题-graduate algorithm operations branch line Traveling Salesman Problem Solving
- 2022-08-22 01:13:58下载
- 积分：1
-
一维伽辽金型无网格法MATLAB程序
无网格方法采用基于点的近似，可以彻底或部分地消除网格，不需要网格的初始划分和重构，不仅可以保证计算的精度，而且可以大大...
一维伽辽金型无网格法MATLAB程序
无网格方法采用基于点的近似，可以彻底或部分地消除网格，不需要网格的初始划分和重构，不仅可以保证计算的精度，而且可以大大减小计算的难度。然而，由于目前的无网格近似一般没有解析表达式，且大都基于伽辽金原理，因此计算量很大，要超出传统的有限元法；另外，无网格近似大都是拟合，因此对于位移边界的处理比较困难，多采用拉格朗日乘子法处理。-1维伽Galerkin-type meshless method MATLAB procedures meshless method based on the point of approximation, can be completely or partially eliminate the grid, the grid does not require the initial division and reconstruction, not only can guarantee the accuracy of the calculation, and can greatly reduce the difficulty of calculation. However, due to the current meshless approximation there is no analytic expression in general, and mostly based on the Galerkin principle, the calculation of a large volume, it is necessary to go beyond the traditional finite element method In addition, the meshless approximation are fitted, so displacement of the border more difficult to deal with, the use of Lagrange law.
- 2022-06-18 16:46:39下载
- 积分：1
-
高维空间中的广义投影群
Finding Generalized Projected Clusters in High Dimensional Spaces - ORCLUS - A subspace clustering algorithm.-Finding Generalized Projected Clusters in High Dimensional Spaces- ORCLUS- A subspace clustering algorithm.
- 2022-08-16 08:51:23下载
- 积分：1
-
dining philosophers problem source code
哲学家就餐问题源代码-dining philosophers problem source code
- 2022-11-23 20:50:03下载
- 积分：1
