-
用JAVA编写的扫雷程序。在JCREAT环境里运行可以使用。
用JAVA编写的扫雷程序。在JCREAT环境里运行可以使用。-prepared using JAVA demining process. In JCREAT operating environment can be used.
- 2022-01-31 21:27:07下载
- 积分:1
-
一个很好的SOKET通信程序,包括客户端和服务器端,编译时候带参数/c或者/s...
一个很好的SOKET通信程序,包括客户端和服务器端,编译时候带参数/c或者/s-a good socket communication program, including client and server sides. Compile with parameter /c or /s
- 2022-02-02 15:33:35下载
- 积分:1
-
some numbers multiply use lian biao make up sdvs sdsvsdv sdvsdsdsdvsdvd
sdfdsfs...
多项式相乘 是关于链表的还算比较完善的-some numbers multiply use lian biao make up sdvs sdsvsdv sdvsdsdsdvsdvd
sdfdsfsd sdfvsdfsd
safsdf
sdf
sdfdsf
sdfds
- 2022-02-10 04:21:47下载
- 积分:1
-
用c++做的,把2张图片融合,可以作为需要图片融合的很好例子...
用c++做的,把2张图片融合,可以作为需要图片融合的很好例子-Using c++ to do the integration of two images, the need for image fusion can be used as a good example of
- 2022-11-17 21:45:04下载
- 积分:1
-
本程序用2003.NET做的.介绍了另一种做法.
本程序用2003.NET做的.介绍了另一种做法.-the procedure used in 2003.NET do. On the other approach.
- 2022-01-29 00:03:26下载
- 积分:1
-
数列极差算法,计算机算法设计与分析中的一道练习题
数列极差算法,计算机算法设计与分析中的一道练习题-Series of very poor algorithm design and analysis of computer algorithms to work together in exercises
- 2023-01-06 20:10:04下载
- 积分:1
-
分析VB工程文件(VBP文件)
分析VB工程文件(VBP文件)-analysis VB project files (VBP)
- 2023-05-20 01:45:03下载
- 积分:1
-
模仿一个flash小游戏“水晶球测心术”,用C语言做的,在TC3和win...
模仿一个flash小游戏“水晶球测心术”,用C语言做的,在TC3和win-tc中运行通过。-Imitation of a small flash game, " Mind Reading Crystal Ball" , with the C language to do, in TC3 and run through the win-tc.
- 2022-05-09 03:43:06下载
- 积分:1
-
修正后版本
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法,适用于解决传统方法难以解决的复杂的、非线性问题,可广...
修正后版本
遗传算法是基于达尔文进化论的一种智能优化算法,一种可用于复杂系统优化的具有鲁棒性的搜索算法,适用于解决传统方法难以解决的复杂的、非线性问题,可广泛应用于组合优化、离散优化、工程优化等领域。旅行商问题是一种NP难的组合优化问题,具有重要的理论研究价值和实际应用背景。然而,传统遗传算法中存在有不足,需要提出新的改进的遗传算法,并应用于旅行商问题的求解。-Amended version of genetic algorithm based on Darwin" s theory of evolution is an intelligent optimization algorithm, a complex system can be used to optimize the robustness of the search algorithm, the application of traditional methods to solve difficult and complex, nonlinear problems, can be widely used in combinatorial optimization, discrete optimization, engineering, optimization and other fields. Traveling Salesman Problem is a NP hard combinatorial optimization problem, has important theoretical value and practical application of research background. However, the traditional genetic algorithm, there is less than the need to introduce new improved genetic algorithm, and applied for solving the traveling salesman problem.
- 2023-06-10 23:05:03下载
- 积分:1
-
bahuanghouwenti dejiejue
bahuanghouwenti dejiejue
- 2022-01-28 08:43:05下载
- 积分:1