登录
首页 » matlab » ClusteringCoefficient

ClusteringCoefficient

于 2012-10-13 发布 文件大小:1KB
0 260
下载积分: 1 下载次数: 10

代码说明:

  此程序用于求网络(交通网,电网,水网等)的聚类系数(This procedure is used to find the clustering coefficient of the network (transportation networks, power grids, water networks, etc.))

文件列表:

ClusteringCoefficient.m,2167,2008-10-07

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • G729
    英文文献,主要内容为G.729标准,语音信号的一种传输协议。(English literature, mainly for the G.729 standard voice signal of a transport protocol.)
    2009-12-14 20:25:50下载
    积分:1
  • Harris
    Harris Corner Detection Matlab
    2010-02-25 02:53:43下载
    积分:1
  • phtonicmatlab
    光子晶体matlab程序,有图像表示!比较长;可以仔细研究!(Photonic crystals matlab program, have images that!)
    2010-05-27 22:49:55下载
    积分:1
  • HFD
    Higuchi Fractional Dimenson Test for Identification of Chaotic Systems
    2011-08-25 17:19:32下载
    积分:1
  • Handout1
    Simulation Guide of MATLAB
    2011-02-07 19:14:04下载
    积分:1
  • classification-for-SVM
    说明:  对数据进行SVM处理,最后以进行定量及分类处理,对得到的预测和训练的数值进行RME等的计算(The data processing, and end with SVM quantitative and classification to get treatment, the numerical prediction and training for calculation of RME etc. )
    2011-03-17 08:47:29下载
    积分:1
  • Burg-algorithm-of-AR
    基于burg算法实现的AR模型功率谱计算,算法已经仿真通过,有前向预测误差及后向预测误差,非常适合与学习加深现代谱估计的理论 (Burg algorithm to achieve the AR model power spectrum calculation algorithm has been through simulation, the forward prediction error and prediction error is ideal for learning to deepen modern spectral estimation theory)
    2012-07-05 00:27:34下载
    积分:1
  • tsp
    蕞优分组周游路线问题是一类物流智能调度问题,是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后,人们对这一类问题给予了极大的关注并进行了大量的研究,提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大,纯数学方法在允许的时间和空间上都很难找到问题的最优解,于是人们开始转向寻找问题的近似最优解,遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效,但对于有多个限制条件的多目标最优化问题缺显得有点力不从心,很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法,虽然建模条件限制了描述的问题的通用性,有待推广,但它能有效利用问题的领域知识,提高了求解效率,保证了解的可行性和最优性,算法思想极具推广潜力,可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)
    2014-08-18 10:05:55下载
    积分:1
  • missile_0
    基于MATLAB的攻击水平机动目标比例导引三维弹道仿真(MATLAB-based attacks proportional navigation for maneuvering target level of three-dimensional trajectory simulation )
    2011-09-24 21:12:38下载
    积分:1
  • ClusterEnsemble-V2.0
    用matlab实现聚类集成算法的功能,内含三个聚类集成算法,结果取最优(Cluster ensemble)
    2013-09-26 16:54:43下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载