资源列表
MGraph
- 用克鲁斯卡尔算法实现的最小生成树代码,要输入边的信息，每条边的信息包括两个顶点号（从1开始）及权值。在这个程序里顶点信息不太重要，只是用一个字符保存的，如需要可自己更改。-create a minimum tree use the Kruskal arithmetic.
ex_2
- 1.编写生成栈的函数，栈的元素从键盘输入 2.编写在栈中压入一个元素的函数 3.编写在栈中弹出一个元素的函数 4.编写主函数，调用以上各函数，以便能观察出各函数的屏幕输出。 -1. Preparation of the function generating the stack, the stack of elements from the keyboard 2. Preparation of pressure on the stack into an element of th
强大的Kalman滤波开发包(matlab版源码)
- 强大的Kalman滤波开发包(matlab版源码)
forKPMtools
- 卡尔曼滤波，能够进行目标位置的预测与识别-Filter of Kalman
sensor
- 货币识别传感器有效性与精度分析方法sensor-Identification of a currency and accuracy analysis of the effectiveness of the sensor
wen.RAR
- 学习mathematics软件，简化数学计算过程，增加精确性-Learning mathematics software, simplifying the process of mathematical calculation, increase accuracy
MPPTresearch
- 介绍最大功率点追踪的变步长的算法和原理。-Describes the maximum power point tracking algorithm and variable step length principle.
baozha
- 生活中我们有这样的常识，在一个密闭的空间中当可燃气体达到一定浓度时，遇明火会立即发生爆炸，即剧烈燃烧瞬间蔓延至整个空间。而爆炸极限指在空气中，可发生爆炸的气体比例区间-In life we have such common sense, in a confined space when the combustible gas reaches a certain concentration, the event of fire will immediately exploded, that is,
AnimalExpert
- C++实现的动物专家系统及推理，可直接在VC中运行-C++, expert systems and reasoning animals can be run directly in the VC in
abc
- 行商问题是一个经典的NP完全问题,多人旅行商问题的求解则更具挑战性。以往对求解多人旅行商问题的研究局限于以所有成员路径总和最小为优化标准-Salesmen problem is a classical NP complete problem, many people are solving the traveling salesman problem more challenging. Solving the traveling salesman problem of many previous
matlabcode
- 随机信号处理原理与实践(课本原代码) 作者杨鉴-matlab code in
PAPER4
- 分数阶Unscented卡尔曼滤波器研究.pdf -Fractional Unscented Kalman Filter