-
panel_2.4
panel 基于matlab的源代码，适合数据的面板分析(Panel based on the matlab source code, suitable for data analysis of the panel)
- 2012-05-01 00:39:03下载
- 积分：1
-
A-Guide-to-MATLAB-Object-Oriented-Programming---A
A Guide to MATLAB Object-Oriented Programming
- 2014-12-04 06:21:50下载
- 积分：1
-
mensuales.m
program to calculate the montly mean of diary rainfall data base
- 2013-10-14 02:26:31下载
- 积分：1
-
gmres-sample
matlab中广义最小残量法的m文件 包含arnoldi过程 和 gmres两部分 (matlab generalized minimum residual method m file contains arnoldi the process and gmres two parts)
- 2020-11-10 20:39:46下载
- 积分：1
-
minq.tar
MINQ - bound constrained quadratic programming
using rank 1 modifications
source: http://solon.cma.univie.ac.at/~neum/software/minq
- 2015-03-31 00:10:48下载
- 积分：1
-
DTS for BU2614
BU2614 PLL 源程序,直接解压(source code for digital tuning system using BU2614 PLL IC. Please unzip directly.)
- 2005-02-24 13:12:33下载
- 积分：1
-
6353mimo_simulator
mimo仿真，适用于初学者，不错的源程序欢迎下载(mimo simulation for beginners, a good source welcome Download)
- 2010-05-25 19:50:44下载
- 积分：1
-
matlab
用matlab实现的多站定位系统性能仿真(Using matlab to achieve multi-station location system performance simulation)
- 2010-06-01 17:19:04下载
- 积分：1
-
SVM
该工具箱包括了二种分类,二种回归,以及一种一类支持向量机算法
(1) Main_SVC_C.m --- C_SVC二类分类算法
(2) Main_SVC_Nu.m --- Nu_SVC二类分类算法
(3) Main_SVM_One_Class.m --- One-Class支持向量机
(4) Main_SVR_Epsilon.m --- Epsilon_SVR回归算法
(5) Main_SVR_Nu.m --- Nu_SVR回归算法(The kit includes two kinds of classification, two kinds of regression, and a one-class support vector machine algorithm (1) Main_SVC_C.m--- C_SVC II classification algorithm (2) Main_SVC_Nu.m--- Nu_SVC II classification algorithm (3) Main_SVM_One_Class.m--- One-Class Support Vector Machine (4) Main_SVR_Epsilon.m--- Epsilon_SVR regression algorithm (5) Main_SVR_Nu.m--- Nu_SVR regression algorithm)
- 2011-07-28 17:15:18下载
- 积分：1
-
TSP(TravelingSalesmanProblem)
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
- 2007-11-15 01:44:52下载
- 积分：1
