-
加法和减法乘法除计算器的源代码
Add and subtract to multiply by in addition to calculator VC source code-Add and subtract to multiply by in addition VC calculator to source code
- 2022-11-10 13:10:03下载
- 积分:1
-
Lib source code of Machine study supporting Vector machine
机器学习支持向量机的代码libsvm 2.36版-Lib source code of Machine study supporting Vector machine
- 2023-03-12 21:40:04下载
- 积分:1
-
MOCA方案介绍,moca为当前使用比较多的EOC解决方案,供大家参考!...
MOCA方案介绍,moca为当前使用比较多的EOC解决方案,供大家参考!-MOCA program introduction, moca for the current use of a relatively large number of EOC solution, for your reference!
- 2022-03-07 10:30:31下载
- 积分:1
-
pci core altera fpga development of design information pci
pci core altera fpga pci开发设计资料-pci core altera fpga development of design information pci
- 2023-03-18 06:40:03下载
- 积分:1
-
VB开发的USB卸载助手源码 VB开发的USB卸载助手源码
VB开发的USB卸载助手源码 VB开发的USB卸载助手源码 -VB development assistant USB uninstall VB source development assistant USB uninstall VB source development assistant USB uninstall VB source development assistant uninstall USB source
- 2022-03-04 18:36:32下载
- 积分:1
-
手机版推箱子游戏,运行于展讯平台,测试通过。
手机版推箱子游戏,运行于展讯平台,测试通过。-Sokoban Games Mobile, running on Spreadtrum platform for the test.
- 2022-01-29 01:33:07下载
- 积分:1
-
2009年9月 《无线电》附资料 可以下载 有源代码
2009年9月 《无线电》附资料 可以下载 有源代码-In September 2009 " radio" attached to the information source code can be downloaded
- 2022-06-12 07:17:37下载
- 积分:1
-
ms SQL 和 sql anywhere 数据库管理实用工具源码
ms SQL 和 sql anywhere 数据库管理实用工具源码-sql anywhere SQL and database management tools usable source
- 2022-01-28 02:10:15下载
- 积分:1
-
dms(struts+spring+hibernate) dataManagerSystem
dms(struts+spring+hibernate)数据管理系统-dms(struts+spring+hibernate) dataManagerSystem
- 2023-08-20 06:25:04下载
- 积分:1
-
最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时,总是把能满足要求、又是最小的空闲分区分配给作业,避免“大材小用”。为了加速寻找,...
最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时,总是把能满足要求、又是最小的空闲分区分配给作业,避免“大材小用”。为了加速寻找,该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样,第一次找到的能满足要求的空闲区,必然是最佳的。-best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.
- 2022-05-21 23:44:10下载
- 积分:1