-
forwardselection
foeward featurrselection
- 2009-09-07 20:10:29下载
- 积分：1
-
ProgrammablePulseGenerator
This is the customized programmable pulse generator using matlab
- 2011-12-16 03:10:41下载
- 积分：1
-
jlfx
聚类分析的matlab函数,内部有详细说明(Cluster analysis of the matlab function, has a detailed description of internal)
- 2007-09-18 20:04:29下载
- 积分：1
-
Circular_electrodes_mathieu_test
Code for testing Mathieu functions for AT
- 2014-11-26 18:13:55下载
- 积分：1
-
Powerflow
潮流，牛顿潮流，主要应用于电力系统中。最基本的算法(Newton trend trend, mainly used in power system.The most basic algorithm)
- 2014-12-05 15:12:04下载
- 积分：1
-
a
这是包含丰富内容的流行学算法工具，里面有大量的MATLAB仿真示例，希望对大家有帮助(It contains rich content tools for popular school algorithm, which has a large number of MATLAB simulation example, we want to help)
- 2011-05-12 10:13:24下载
- 积分：1
-
matlab
porter stemmer developed in matlab based on 1980 porter stemmer algorithm
- 2013-05-05 19:24:47下载
- 积分：1
-
fuzzy_adaptive
模糊自适应pid例子，自己做的，结果很好！欢迎大家学习(fuzzy adaptive PID)
- 2020-06-28 22:40:01下载
- 积分：1
-
feusnite
实现了对10个数字音的识别，JhgOJCD参数基于人工神经网络的常用数字信号调制，滤波求和方式实现宽带波束形成，matlab开发工具箱中的支持向量机，xifIDUF条件包含特征值与特征向量的提取、训练样本以及最后的识别，主要是基于mtlab的程序。( To achieve the recognition of 10 digital sound, JhgOJCD parameter The commonly used digital signal modulation based on artificial neural network, Filtering summation way broadband beamforming, matlab development toolbox support vector machine, xifIDUF condition Contains the eigenvalue and eigenvector extraction, the training sample, and the final recognition, Mainly based on the mtlab procedures.)
- 2016-02-24 17:17:36下载
- 积分：1
-
danchunxingfa
单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分：1
