-
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
-
MATLABMATHCompleteEdition
MATLAB 数学手册完整版 很实用,是word版本(MATLAB Mathmatical Guide Complete version )
- 2009-06-10 23:39:36下载
- 积分：1
-
emd_new
EMD的matlab例程，用于振动、医疗、工业等领域中的信号处理(EMD Matlab routines for vibration, health, industry and other fields of signal processing)
- 2007-05-20 15:32:23下载
- 积分：1
-
2DEIT_matlab
MATLAB二维电阻抗断层成像算法!用于医学成像,里面包括有限元剖分正问题,及反问题的算法.并且附有网络剖分数据表!(MATLAB two-dimensional electrical impedance tomography algorithm! For medical imaging, which include the finite element mesh is the problem and inverse problem algorithms. And with a network partition data tables!)
- 2021-02-22 21:59:41下载
- 积分：1
-
GA
说明： 一个遗传算法的matlab程序，比较基础，也比较简单。(A genetic algorithm matlab procedures, basis of comparison, it is relatively simple.)
- 2008-09-05 09:02:46下载
- 积分：1
-
sim_qpskgray_multipath
O-QPSK modulation and demodulation taking into account Multi-path Fading
- 2009-10-30 07:26:38下载
- 积分：1
-
Errortf
this source code is good
- 2013-08-16 01:28:51下载
- 积分：1
-
code
基于MATLAB的基础分水岭算法及改进算法的实现(the application and the improvement of the watershed algorithm )
- 2015-01-13 15:09:53下载
- 积分：1
-
fano
设有离散无记忆信源X,P(X)．二进制费诺编码为：1.将信源符号按概率从大到小的顺序排列2.将信源分成两组――按两组概率之差为最小分．3.上面一组编码为0，下面一组编码为1，一直分到一组只有一个信源为止．4.将一个信源分组得到的0和1全部连接起来，组成该信源的码字，信源即得到自己的费诺编码．(There be no X remembering the message source in case that having being scattered, binary Feinuo of P (X) code is: 1. Will believe that the source sign orders 2 according to probability is minor from arriving at greatly sequence. Will believe that the source divides into two part being allotted 3 according to two set of bad of probability for the minimum. A group of code is 0 above , a group of code is 1 underneath, till dividing till a group only when one believes a source 4. Get up with a 0 and 1 all connection believing that the source is divided into groups and , be composed of the codon owing message a source , believe that the source is to get self Feinuo code
Powered )
- 2009-11-27 12:04:44下载
- 积分：1
-
0750679123
yah sure its useful.thanks for sharig
- 2010-12-01 18:04:53下载
- 积分：1
