-
part1
盲信号处理研究论文，这是第一部分，包括前两章的内容和仿真程序。(Blind signal processing research papers, this is the first part, including the first two chapters of the content and simulation program.)
- 2007-09-24 12:46:46下载
- 积分：1
-
Chapter1
数据测试，数据分析，数据还原，数据载入。(Data testing, data analysis, data reduction, data load.)
- 2014-11-29 15:13:20下载
- 积分：1
-
zizuokalman
卡尔曼在目标跟踪中的应用本文对作匀速运动的二维空中机动目标进行研究，利用交互式多模型方法对雷达目标进行跟踪(target tracking in the application of this uniform motion for the two-dimensional aerial maneuvers goals, use of interactive multi-model approach to tracking radar targets)
- 2020-07-26 22:18:41下载
- 积分：1
-
boostspi
boos pi controller close loop
- 2013-10-18 19:00:52下载
- 积分：1
-
PLZERN.M
wavefront deformation. Matlab file
- 2013-10-21 21:56:14下载
- 积分：1
-
feige
install code to the document,and replease ,make project
- 2007-11-14 10:47:46下载
- 积分：1
-
yundongguji
运动估计的算法，基于matlab可以对运动物体过快的图像进行补偿(Motion estimation algorithm, based on the matlab fast moving objects on the image to compensate)
- 2009-05-09 12:49:14下载
- 积分：1
-
6
说明： 基于遗传算法的车间布局优化MATLAB源码
车间布局优化是将加工设备、物料输送设备、工作单元和通道走廊等布置物体合理地放置在一个有限的生产车间内的过程。车间布局优化模型是一个含有较为复杂约束的非线性连续优化模型，可以使用遗传算法进行优化。
(Layout based on genetic algorithms optimization MATLAB Optimization is the source plant processing equipment, material handling equipment, work unit and channel corridors reasonable layout objects placed in a limited course of the production workshop. Optimization Model is a workshop with more complex nonlinear continuous constrained optimization model, you can use the genetic algorithm optimization.)
- 2011-05-10 16:07:50下载
- 积分：1
-
xfs_dquot_item
returns the number of iovecs needed to log the given dquot item.
- 2014-09-11 23:27:59下载
- 积分：1
-
TSP
旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)
- 2015-01-18 21:43:12下载
- 积分：1
|
联系客服（QQ：3324461878）
