-
一维云
说明: 实现一维云作图 ,一维云正向发生器代码,MATLAB专业代码(One dimensional cloud mapping)
- 2020-12-04 14:27:01下载
- 积分:1
-
operate a registry of the class
一个操作注册表的类的应用-operate a registry of the class
- 2022-02-24 15:00:12下载
- 积分:1
-
新建文件夹 (3)
主动噪声控制,消除单通道噪声中的声音,对次级路径进行实时的估计,得到精确的权值。(Active Noise Control)
- 2019-03-15 13:14:53下载
- 积分:1
-
Java写的放大镜程序
Java写的放大镜程序,Java写的类似放大镜的程序,还没有经过测试,感兴趣的自己下载源码编译下。
- 2022-02-06 01:28:54下载
- 积分:1
-
嵌入式实时多任务操作系统培训教材,想学习嵌入式程序设计的同学们可以参考一下阿!...
嵌入式实时多任务操作系统培训教材,想学习嵌入式程序设计的同学们可以参考一下阿!-Embedded real-time multi-tasking operating system, training materials, want to learn the embedded programming students can refer to the Arab-Israeli!
- 2022-03-03 05:48:25下载
- 积分:1
-
遗传算法求解多旅行商问题
说明: 旅行商问题(TravelingSalesmanProblem,TSP)是一个经典的组合优化问题。经典的TSP可以描述为:一个商品推销员要去若干个城市推销商品,该推销员从一个城市出发,需要经过所有城市后,回到出发地。应如何选择行进路线,以使总的行程最短。从图论的角度来看,该问题实质是在一个带权完全无向图中,找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列,随着顶点数的增加,会产生组合爆炸,它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分:1
-
contribute to a good Dong
再次贡献一个好东东-ccrtp,大家研究一下-contribute to a good Dong-ccrtp, we look at
- 2023-03-27 08:10:04下载
- 积分:1
-
ip
ip从char[]转为int,ip地址转换( transform ip from char[] to int)
- 2012-05-22 15:11:35下载
- 积分:1
-
[60]UCOS+UCGUI_TFT9.0inch
Ucos Operating system for Lcd 9"
- 2018-01-04 22:14:50下载
- 积分:1
-
cs
说明: 压缩感知 omp算法、bpdn算法恢复频率(compressed sensing OMP)
- 2020-09-21 21:57:49下载
- 积分:1