-
imageRotate
在matlab中，实现图像旋转（两种方法：临近法、双线性法）(In matlab, the realization of image rotation (two methods: near the bilinear method))
- 2010-07-22 11:58:36下载
- 积分：1
-
PCMPDM
脉冲编码调制系统和增量调制系统的MATLAB源程序(Pulse code modulation system and delta modulation system MATLAB)
- 2013-09-27 09:11:25下载
- 积分：1
-
matlab-code-algorithm-for-ACO_on_JSSP
Accountable Care Organizations (ACOs) are groups of doctors, hospitals, and other health care providers, who come together voluntarily to give coordinated high quality care to their Medicare patien
- 2013-12-30 00:28:17下载
- 积分：1
-
Desktop
matlab调用vissim com文件，简单的单个交叉口的信号配时案例(Matlab call vissim com file, a simple single intersection signal timing case)
- 2017-03-23 15:12:11下载
- 积分：1
-
决策树
基于决策树的五分类算法，可以达到较高的识别率(The five classification algorithm based on decision tree can achieve higher recognition rate.)
- 2021-03-27 15:29:13下载
- 积分：1
-
matlab6yingyongkaifazhinan
matlab6应用开发指南，软件开发技术丛书，机械工业出版社(MATLAB6 Application Development Guide, Software Development Technical Series, Mechanical Industry Press)
- 2008-06-03 08:21:05下载
- 积分：1
-
convolution_codes_BPSK_OFDM
基于OFDM系统的卷积码的误码性能分析，BPSK调制，加循环前缀，导频，进行了信道估计。(OFDM system；convolutional code BPSK modulation pilot Channel Estimation )
- 2014-01-01 21:47:55下载
- 积分：1
-
tsp
遗传算法解决 TSP 问题:已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市(Known n the distance between cities, a salesman must visit the n city, and each city can only visit once, and finally must return to the starting city
)
- 2016-09-10 16:08:07下载
- 积分：1
-
0-1programming
0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。另：胡运权所著的《运筹学基础及应用（第三版）》第97页的例3，我用本程序求解得到的结果是：最优解是x*=(1,0, 0, 0, 0)，最优值是f(x*)=8，但书求得最优解是x*=(1,0, 1, 0, 0)，最优值是f(x*)=4，是不是书中写错了，请大家验证。以下是源程序，大家可以任意使用无版权问题，另外，如果大家有大规模的0-1规划的问题也希望提供给我，谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
- 2006-07-01 10:33:18下载
- 积分：1
-
AP
AP算法源码代 运行可以画出图 AP算法源码代 运行可以画出图(AP algorithm source code to run on behalf of AP algorithm source code can be drawn diagram can be drawn map on behalf of running)
- 2013-08-15 14:56:28下载
- 积分：1
