-
JM98A1
说明： 风险投资模型求解，用此程序求解出投资风险组合。(Venture capital model to solve, using this procedure for solving a portfolio of investment risks.)
- 2010-03-26 16:44:37下载
- 积分：1
-
Learning_svm
自己学习svm，编写的几个svm实例代码(Their own learning svm, svm example code written in several)
- 2011-11-28 17:07:11下载
- 积分：1
-
tamrin6dipolefeed0.33l
this file contains the matlab codes that calculate dipole antenna characteristics in different wavelength.
- 2013-01-09 17:15:07下载
- 积分：1
-
ICAdemo
计算机仿真用于主成分分析的ICA分析程序，算法举例和波形分析程序。(Computer simulation for analysis of principal component analysis of ICA procedures, algorithms and waveform analysis program for example.)
- 2010-05-16 18:57:42下载
- 积分：1
-
Three-Level-NPC-Quasi-Z-Source-Inverter
it is about npc inverter
- 2014-08-18 12:51:37下载
- 积分：1
-
Time-Frequency-Toolbox
时频率分析工具箱，内置函数，matlab实用分析，M文件类型(Time frequency analysis toolbox, built-in functions, matlab practical analysis, M File Type)
- 2012-10-24 11:36:02下载
- 积分：1
-
SVM
模式识别，线性分类器。经调试可用，希望可以帮到需要的人。(Pattern recognition, linear classifier. After debugging is available, the desire to help people in need.)
- 2013-05-26 12:05:02下载
- 积分：1
-
30个智能算法模型
1-8遗传算法，9 多目标Pareto最优解搜索算法，10 基于多目标Pareto的二维背包搜索算法，11-12免疫算法，13-17粒子群算法，18鱼群算法，19-21模拟退火算法，22-24蚁群算法，25-27神经网络，28 支持向量机的分类，29 支持向量机的回归拟合，30 极限学习机的回归拟合及分类(1-8 genetic algorithm, 9 multi-objective Pareto optimal solution search algorithm, 10 multi-objective Pareto based two-dimensional knapsack search algorithm, 11-12 immune algorithm, 13-17 particle swarm algorithm, 18 fish swarm algorithm, 19-21 simulated annealing algorithm, 22-24 ant colony algorithm, 25-27 neural network, 28 support vector machine classification, 29 support vector machine regression simulation Regression Fitting and Classification of Combination, 30 Extreme Learning Machines)
- 2018-12-03 11:17:41下载
- 积分：1
-
SampleQuestions
high speed networks ebooks sample questions
- 2014-09-05 18:06:02下载
- 积分：1
-
Minimum-Cost-Flow
最小费用最大流问题是经济学和管理学中的一类典型问题。在一个网络中每段路径都有“容量”和“费用”两个限制的条件下，此类问题的研究试图寻找出：流量从A到B，如何选择路径、分配经过路径的流量，可以达到所用的费用最小的要求。(Minimum cost maximum flow problem is economics and management in a class of typical problems. Each path in a network has the " capacity" and " costs" two limiting conditions, such problems of trying to find out: Flow from A to B, how to choose the path, the path of the flow through the distribution can be achieved The use of the minimum cost requirements.)
- 2013-08-23 23:10:20下载
- 积分：1
