-
matlab_point
说明： 此软件可用来计算节点数，也可用来计算一些简单的算法，如果你对数据结构感兴趣，也可以用此软件解决数据结构的很多问题
(software can be used to calculate nodes, but also can be used to calculate some simple algorithm, If you are interested in the data structure can also use this software to solve many data structure problem)
- 2006-01-08 17:03:03下载
- 积分：1
-
acoutic
地震波场模拟，二维声波模拟！未加边界条件，新手学习还是可以滴！(2D seismic wave forward modelling)
- 2014-10-09 10:28:12下载
- 积分：1
-
ToolboxAndApplicationOfGeneticAlgo
这是一份matlab的遗传算法实现案例，是南京大学软件学院算法课程的高级实践课题，具有一定的指导意义(This is the case of a matlab genetic algorithm, Nanjing University School of Software Algorithms course practical issues, has a certain significance)
- 2013-03-09 14:29:00下载
- 积分：1
-
xiebojiec
三相桥式整流电路带阻感负载谐波电流源,用simulink搭建的谐波检测仿真电路。用于对所产生的现象进行合理解释，并对波形进行傅立叶频谱分析。(Three-phase bridge rectifier circuit with resistive inductive load harmonic current sources of harmonic detection using simulink simulation circuit structures. Generated for a reasonable explanation of the phenomenon, and the waveform Fourier spectral analysis.)
- 2021-02-26 16:49:37下载
- 积分：1
-
test_rob
robust control matlab program
- 2011-10-15 08:51:04下载
- 积分：1
-
altreadsegy
读segy程序，地球物理专业必用程序，matlab程序，希望对您有用。(Read segy program, geophysical professional will use program, matlab, hope useful to you.
)
- 2014-11-06 11:09:29下载
- 积分：1
-
6cluster
北大高慧璇版《应用多元统计分析》第六章聚类分析MATLAB编程源码(Cluster Matlab Source Code)
- 2011-12-01 08:59:44下载
- 积分：1
-
add2System
this is the3rd file i m uploading
- 2011-05-17 02:06:22下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
-
knnl
classification reseau de neurone
- 2012-03-27 11:11:05下载
- 积分：1
