登录
首页 » matlab » NK12---1000

NK12---1000

于 2021-01-28 发布 文件大小:1KB
0 254
下载积分: 1 下载次数: 2

代码说明:

  针对NK模型的仿真,有1000次迭代的情况,很有参考价值(For NK model simulation, there are 1000 iterations situation of great reference value)

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

发表评论

0 个回复

  • BCS_upload
    This is a demo code to illustrate application of blind compressive sensing framework to recommender system design (to predict users choice for items).
    2014-09-28 08:34:57下载
    积分:1
  • concretetem
    concrete temperature at early ages
    2014-11-23 00:52:59下载
    积分:1
  • DVB-T2-MATLAB-BCH
    DVB-T2中13种码率的BCH编码matlab仿真程序(BCH code in DVB-T2)
    2012-01-05 16:14:54下载
    积分:1
  • Viterbi
    Viterbi Decoder Matlab file
    2014-02-16 03:14:14下载
    积分:1
  • Spread_Frequency
    TD中扩频的链路级仿真 通过MATLAB实现(TD Spreading the Link Simulation through MATLAB)
    2007-04-18 14:19:23下载
    积分:1
  • modis_Spectral_response_function_fit
    处理一定的遥感数据,可以自动读取,也可以将其生成。(Processing of remote sensing data can be automatically read, and can also be generated.)
    2012-05-19 10:46:36下载
    积分:1
  • 802.11a-baseband_2
    IEEE 802.11a-1999 or 802.11a was an amendment to the IEEE 802.11 wireless local network specifications that defined requirements for an orthogonal frequency division multiplexing (OFDM) communication system. It was originally designed to support wireless communication in the unlicensed national information infrastructure (U-NII) bands (in the 5–6 GHz frequency range) as regulated in the United States by the Code of Federal Regulations, Title 47, Section 15.407.
    2014-02-01 23:29:12下载
    积分:1
  • RMSE
    求解各类误差,精确,如RMSE,样本数据是自己给出的可替换(finding all kinds of error)
    2015-11-14 09:52:47下载
    积分:1
  • k-means
    说明:  k均值聚类算法(k-means clustering algorithm)是一种迭代求解的聚类分析算法,其步骤是,预将数据分为K组,则随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。(The k-means clustering algorithm is an iteratively solved clustering algorithm in which the data is pre-divided into K groups, the K objects are randomly selected as the initial clustering center, and then the distance between each object and the seed clustering center is calculated, and each object is assigned to the clustering center closest to it.)
    2020-11-08 10:47:08下载
    积分:1
  • K-Ltransform
    Using K-L transform to compress data is straightforward, since we can use a d dimensional vector to represent a D dimensional one without lose of much information. (Using KL transform to compress data is straightforward, since we can use ad dimensional vector to represent a D dimensional one without lose of much information.)
    2007-11-27 15:12:27下载
    积分:1
  • 696518资源总数
  • 106208会员总数
  • 21今日下载