登录
首页 » matlab » matlab

matlab

于 2009-09-12 发布 文件大小:2KB
0 200
下载积分: 1 下载次数: 5

代码说明:

  对排队进行计算的算发,所用环境matlab(Queuing)

文件列表:

Untitled.m

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

发表评论

0 个回复

  • 3DTEPML
    应用MATLAB编写的三维时域有限差分程序。是初学FDTD的好帮手。建议初学者参考。(Application of MATLAB to prepare three-dimensional finite difference time domain procedure. FDTD are learning a good helper. Recommended reference for beginners.)
    2009-02-16 16:27:26下载
    积分:1
  • 学习matlab的好教-mfiles
    同上,学习matlab的好教程,呵呵,大家不要骂我亚(ibid., Matlab good learning guides, huh, I do not criticize Asia)
    2005-04-13 20:28:33下载
    积分:1
  • dfsorigin
    DFS in Matlab, Depth First Search
    2009-12-10 00:49:58下载
    积分:1
  • matlab
    说明:  matlab实验报告 学习A律PCM量化器的matlab代码(Programmable test report: Learning A law PCM quantizer matlab code)
    2010-04-21 21:33:20下载
    积分:1
  • fiber_mode_distribution
    多模光纤模式能量分布图形,彩色强度图,十分漂亮(the modes distributions of multi modes in fiber, intensity graphi, very beautiful)
    2021-01-22 16:38:40下载
    积分:1
  • online
    这个小程序可以实现窗口的创建以及同步接收和发送消息的功能。(WHEN YOU SEND MESSAGE TO OTHERS ,THEY WILL CAN RECEIVE IT TIGHT NOW.)
    2014-09-17 19:43:37下载
    积分:1
  • code
    通过MATLAB平台对通信仿真,研究讨论Turbo码的编译码结构,四种Turbo码译码算法,讨论Turbo码中几种常见的交织器,利用MATLAB软件平台进行并行级联Turbo卷积码的性能仿真,仿真评估了不同设计参数对Turbo码性能的影响。(Through MATLAB simulation platform for communications, research and discussion Turbo code decoding structure, four kinds of Turbo code decoding algorithm, discuss several common Turbo code interleaver, using MATLAB software platform for parallel concatenated convolutional codes Turbo Performance Simulation , simulation and evaluation of different design parameters on Turbo code performance.)
    2013-10-08 09:45:50下载
    积分:1
  • sfunctionrus
    somthing russian function, by artemy
    2015-03-26 08:04:51下载
    积分:1
  • ARIMA--AIC
    改进aic准则ARIMA模型,通过调整误差来寻找p和q(ARIMA model)
    2014-06-04 19:20:26下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载