-
CPD
Point Set Registration: Coherent Point Drift 的源代码(Source code of Andriy Myronenko, Xubo Song, "Point Set Registration: Coherent Point Drift," IEEE Transactions on Pattern Analysis and Machine Intelligence, 25 Feb. 2010. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2010.46>)
- 2010-07-07 01:30:07下载
- 积分:1
-
ESPMA
说明: 自己编写的改进人口迁移算法求解函数最优值,已实现(I have written to improve the migration algorithm optimal value function has been to achieve)
- 2008-12-03 22:34:26下载
- 积分:1
-
fbwuwei
无刷直流电机方波电机控制系统,经验证后,能得出很好的控制效果。(Brushless DC motor square wave motor control system, proven, can come up with a good control effect.)
- 2013-04-10 17:06:26下载
- 积分:1
-
AGCjamming
对AGC中频仿真及加干扰效果分析,采用simulink搭建干扰模型,MATLAB脚本控制参数(IF AGC and added to simulate the effect of interference analysis, interference model using simulink structures, MATLAB Script Control parameters)
- 2015-05-06 20:50:12下载
- 积分:1
-
Final Version
说明: 三自由度 3-DOF 平台的运动学和轨迹规划(Kinematics and Trajectory planning of a 3-DOF platform with 3 extensible limbs)
- 2020-10-06 01:02:54下载
- 积分:1
-
lab7_Symbol_Timing_Synchronization
The Simulation Symbol Timing Synchronization using Matlab(The Simulation Symbol Timing Synchroniza tion using Matlab)
- 2007-03-03 17:49:48下载
- 积分:1
-
SGA-JAVA
遗传算法的JAVA实现 做了一个简单函数优化示例~~~~~~体现了面向对象思想(JAVA realization of genetic algorithm to do a simple example of function optimization ~~~~~~ reflects the object-oriented thinking)
- 2008-05-16 14:12:23下载
- 积分: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
-
lshexiangtoushuru1
用matlab实现摄像头输入 当关闭界面时 保存关闭时的图像(Matlab implementation with off camera input interface when saving images off)
- 2011-05-13 13:23:36下载
- 积分:1
-
xlzkd
用于分析线列阵宽带,可以修改参数,自己编写,仅供参考(For the analysis of line array broadband, you can modify the parameters, write your own, for reference only)
- 2013-03-15 15:54:01下载
- 积分:1