登录
首页 » matlab » matlab

matlab

于 2012-10-16 发布 文件大小:399KB
0 265
下载积分: 1 下载次数: 4

代码说明:

  我开始学习时看的matlab教程,很好的学习资料,主要里面的例子,代码95 以上都是正确的,非常方便。(Matlab tutorial, I began to learn to see the good learning materials, mainly inside the example, more than 95 of the code are correct, very convenient.)

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

发表评论

0 个回复

  • csdigit
    二进制转成CSD编码的Matlab程序,只要运行就可以实现(CSD code convert binary Matlab program can be achieved as long as the running)
    2011-06-02 13:31:16下载
    积分:1
  • peizhun1
    图像配准程序,采用双线性插值,结果能运行。(Image registration process, USES the bilinear interpolation, the result can run.)
    2014-10-08 20:44:44下载
    积分:1
  • DCT_OMP_block
    CS-OMP分块处理,速度远高于按列处理 matlab程序,将两个文件放到同一路径下,可直接运行(OMP block processing by matlab. can run directly.)
    2015-01-05 18:23:51下载
    积分:1
  • maxvrais_modele_lineaire_rec
    最大似然估计算法Matlab实现,不容易啊!!!!!!!!!!(Maximum likelihood estimate,not so esay!!!!!!!!!!)
    2013-11-28 20:22:13下载
    积分:1
  • ILC_openedloop
    说明:  据和离线数据相结合的数据驱动控制方法中,最典型的就是迭代学习控制算法(ashi hi hi ashidaksf shab)
    2021-03-11 13:09:26下载
    积分:1
  • autotunerPID
    这是一个PID自动调节的程序,里面的PID自动调节算法很好的(This is a PID automatic adjustment procedures, which automatically adjust the PID algorithm good)
    2007-01-19 08:52:36下载
    积分:1
  • daimayasuo
    包含:基于蚁群算法求解对称非对称旅行商问题 粒子群优化算法演示(PSO) 基于遗传算法(GA)的多变量旅行商问题(TSP) 遗传算法优化BP 神经网络在数据预测方面的应用 金融数量分析相关代码(Comprising: Solving Symmetric Asymmetric Traveling Salesman Problem Based on Ant Colony Algorithm Particle Swarm Optimization Demo (PSO) Multivariable traveling salesman problem (TSP) based on genetic algorithm (GA) of Genetic algorithm optimization BP neural network in forecasting data Financial analysis of the relevant code number)
    2020-07-26 15:58:40下载
    积分:1
  • chengxu1
    说明:  有关信号与信息系统的matlab程序--傅立叶级数和变换(Signal and information systems related to the matlab procedure- Fourier series and transform)
    2008-11-04 13:52:02下载
    积分:1
  • life
    This file contains life matlab
    2011-10-08 16:26:17下载
    积分:1
  • tsp-matlab
    The travelling salesman problem (TSP) or travelling salesperson problem asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
    2013-10-22 00:42:51下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载