-
gulpDemo
说明： 基于gulp的打包流程，简单实用，条例清楚(Packaging process based on gulp)
- 2020-06-24 08:20:02下载
- 积分：1
-
yuqing
说明： Scanning and source code analysis of designated websites, forums, posting bars, micro-blogs and Weixin public documents can be carried out. Meanwhile, feature numbers can be grabbed. Public opinion warning can be carried out through three modes: system interface, mail and short message, and various graphical public opinion analysis can be provided. At the same time, the system supports multi-level departments and multi-user definitions. Deploying a system can provide independent public opinion monitoring services for different departments. It is a low-cost, high-efficiency and high-precision Internet public opinion monitoring solution.
- 2019-06-04 15:06:34下载
- 积分：1
-
spxy
spxy样本挑选(spxy selection of samples)
- 2018-05-27 11:33:00下载
- 积分：1
-
19854785relay
hslogic算法仿真，基于MATLAB的中继系统的仿真，瑞利信道下进行测试误码率(Hslogic algorithm simulation, relay system simulation based on MATLAB, test bit error rate under Rayleigh channel)
- 2020-06-19 00:40:02下载
- 积分：1
-
基于战舰版的IIC模式的射频RC522
RC522 IIC
基于战舰版的IIC模式的射频RC522
利用IIC实现RC522芯片读写卡(RC522 IIC
Radio Frequency RC522 Based on Warship Version IIC Mode
Realization of RC522 Read-Write Card by IIC)
- 2020-06-16 06:00:02下载
- 积分：1
-
g1030
C语言小程序，实现功能：输入整数，整数和浮点型 倒数和(C language applet functions: input integer, integer and floating-point reciprocal and)
- 2013-05-26 16:52:40下载
- 积分：1
-
fft1024 verilog代码
fft1024 verilog 代码 可以编译成功 建议下载学习(The fft1024 verilog code can compile successful Suggestions for download learning)
- 2017-07-20 10:31:05下载
- 积分：1
-
chapter22
在城市之间优化最短路径蚁群算法程序设计（非原创）(Optimizing the Shortest Path Between Cities)
- 2020-06-23 10:00:01下载
- 积分：1
-
Website source code, not wanting not under!
网站源代码，不要者勿下！- Website source code, not wanting not under!
- 2022-06-20 22:12:26下载
- 积分：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
