-
BGf
计算给定图的最小费用最大流计算给定图的最小费用最大流计算给定图的最小费用最大流(Calculated for a given map of the minimum cost maximum flow calculation Given a graph of the minimum cost maximum flow calculation Given a graph of the minimum cost maximum flow)
- 2010-08-17 22:09:17下载
- 积分:1
-
MATLAB_Programming_for_Engineers
MATLAB 编程
(第二版)菜鸟入门教材
(Stephen J. Chapman)邢树军 郑碧波 译(
MATLAB Programming for Engineers
(Second Edition))
- 2010-11-03 20:46:19下载
- 积分:1
-
bestbarcode
说明: 这是一个非常好的MATLAB条形码识别程序,里面包含M程序,执行所需图片,可直接执行,对于研究条形码识别的有非常好的帮助(This is a very good program MATLAB bar code, which contains M program, the implementation of the necessary pictures, can direct the implementation of bar code identification for the study of very good help)
- 2010-04-21 22:01:17下载
- 积分:1
-
usart2
这是我收集的几个通信基础理论的Matlab仿真实现,包括bpsk、qpsk、ofdm以及信号衰减和延迟的仿真。尽管不是我本人原创,但比较都经典(gggggggggggggg)
- 2010-08-24 10:46:15下载
- 积分:1
-
Matlab
说明: Matlab中寻找二值图像最大联通域的算法(The algorithm of find the largest Unicom domain in binary images with Matlab)
- 2010-04-21 21:24:00下载
- 积分:1
-
mm1
this is source code for M/M/1 Queueing method
simulation with matlab
- 2012-07-09 05:09:29下载
- 积分:1
-
CKFinNavigation
运用基于球径容积准则的CKF对惯性器件输出数据和GPS数据尽心融合处理,达到组合导航定位的目的(CKF based on spherical diameter volume criterion is used to fuse the output data of inertial devices and GPS data to achieve the goal of integrated navigation and positioning.)
- 2018-11-09 17:51:43下载
- 积分:1
-
Kmeans_test
说明: K-Means聚类算法,内附参考文献,亲测可用,性能良好,效果极为明显,完全适用于各种数据维度的数据集分类,欢迎下载使用。(K-Means clustering algorithm, pro-test available.)
- 2019-03-29 20:47:26下载
- 积分:1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。
bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分:1
-
1
说明: ofdm系统下的频偏估计算法,moose算法的仿真(Frequency Offset Estimation ofdm system simulation algorithm, moose algorithm)
- 2021-04-26 12:28:46下载
- 积分:1