-
wintech_training_4
闻亭公司培训DM642的内部资料一共有五天,里面包含讲解的ppt,文档,开发工具,课堂源码例子等。这是第四天内容.(Wintech DM642 training information, total of five parts, which contains explanations ppt, documentation, development tools, source code examples of class and so on.This is the 4th part.
)
- 2009-11-12 14:47:31下载
- 积分:1
-
interleaving
This is a wireless communication codes based on adaptive interleaving
- 2010-12-14 19:29:45下载
- 积分:1
-
INTRO-TO-MATLAB_ppt
Introduction to Matlab
- 2011-01-28 17:57:51下载
- 积分:1
-
yuan34576578
说明: 计算在一个矩形里,用同等大小圆来覆盖这个区域,所需要的最小圆个数,我已经运行过(Calculated in a rectangle, the circle with the same size to cover the region, the minimum required for a round number, I have to run-off)
- 2009-08-20 16:05:39下载
- 积分:1
-
syamlal-obrien_drag
fluent syamlal-obrien模型(fluent syamlal-obrien model)
- 2015-01-18 19:16:32下载
- 积分:1
-
CHENJIANG
卡尔曼滤波灰色理论在变形监测中的预测预报(Calman filter grey theory in prediction of deformation monitoring)
- 2018-05-20 10:24:44下载
- 积分:1
-
MatlabScript
利用MFC技术,借助MATLAB强大的数学计算能力。同时,MATLAB脚本方便修改,不需要重新运行程序。(Using MFC technology, using MATLAB a powerful mathematical calculation. At the same time, MATLAB scripts to facilitate changes, do not need to re-run the program.)
- 2010-06-24 07:35:25下载
- 积分:1
-
exam9
线谱增强器,用于单频信号检测的线谱增强。(Line spectrum enhancer for the single-frequency signal detection to enhance the line spectrum.)
- 2009-05-14 01:09:54下载
- 积分:1
-
6-10
自适应滤波原理(国外教材)计算机作业的MATLAB程序,调试通过,有一定的参考价值。(Principles of Adaptive Filtering (foreign materials) MATLAB computer operating procedures, testing is passed, there is a certain reference value.)
- 2009-06-07 14:37:07下载
- 积分:1
-
Dijkstra
说明: 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法,用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展,直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解,但由于它遍历计算的节点很多,所以效率低。
Dijkstra算法是很有代表性的最短路算法,在很多专业课程中都作为基本内容有详细的介绍,如数据结构,图论,运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分:1