-
Simulink
smuilink仿真教程 十分详细,适合自学的人(smuilink Simulation Tutorial)
- 2012-06-05 00:14:48下载
- 积分:1
-
Fingerprint-Clustering
fingerprint clustering
- 2011-10-09 15:40:27下载
- 积分:1
-
ENCP
a complete program for calculating and plotting effective nuclear charge
- 2014-12-13 02:20:53下载
- 积分:1
-
BER_OFDM_OQAM_main
wireless 5g opfd matlab
- 2020-07-02 18:00:02下载
- 积分:1
-
Network-intrusion
kohonen网络的聚类算法,网络入侵聚类,matlab的经典算法(
kohonen网络的聚类算法,网络入侵聚类,matlab的经典算法
Clustering algorithm of Kohonen network, the network intrusion clustering, matlab algorithm
)
- 2013-10-19 23:51:21下载
- 积分:1
-
Dijkstra_matlab
Dijkstra算法求任意两点间最短路径,有完整的matlab程序(Dijkstra algorithm to find the shortest path between any two points, a complete matlab program)
- 2013-11-03 16:25:12下载
- 积分:1
-
doa_wide_tct
宽带波达方向估计的matlab仿真程序,使用tct算法求聚焦矩阵然后由music算法估计。(Broadband DOA estimation matlab simulation program, using tct algorithm seeking focusing matrix estimation algorithm is then music.)
- 2021-04-18 23:48:57下载
- 积分:1
-
thirtypulseconverterieeefinal
thirty pulse converting system.enjoy on it
- 2013-07-25 15:51:09下载
- 积分:1
-
popov1
基于popov超稳定性的模型参考自适应控制matlab仿真(popov)
- 2021-02-23 01:49:41下载
- 积分:1
-
Floyd
从任意一条单边路径开始。所有两点之间的距离是边的权,或者无穷大,如果两点之间没有边相连。 2,对于每一对顶点 u 和 v,看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。 3,不可思议的是,只要按排适当,就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
- 2011-09-02 23:33:33下载
- 积分:1