资源列表
Branch_Cut_Programming
- 枝切法实现图像的解缠绕的程序，很实用，很全面！程序写的很清楚。-Branch-cut method to achieve image unwrapping, very practical, very comprehensive! Procedure was very clear.
Optimization
- 模拟超市购物情况，根据输入人物特点，对其排队时间给出最优化解决。-choose the queue for minimal time
Kalmanfilter_C
- c语言编写的卡尔曼滤波器(kalman)算法，可用于对信号进行滤波处理。研究导航和控制方面的朋友一定用得上。-c language prepared by the Kalman filter (VD) algorithm can be used to signal filtering. Research navigation and control of some useful friends.
Poj_1011_sticks
- 由题意知道，本题就是根据题目给出的木棒，拼出长度最短的等长的棒子，本题主要应用了深度优先搜索+强剪枝。我们知道，肯定是先把小棒排序，从最大的开始枚举，然后如果到某一个长度时，满足条件，哪么就输出该长度。-George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the origi
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
EX04
- 遗传算法，用此算法可以得到很多计算背包问题的方法，可以和其他的算法进行比较。-Genetic algorithm, using this algorithm for calculating the backpack can be a lot of problems, and other algorithms can be compared.
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题, 相似问题经常出现在商业、投资组合优化、组合数学，计算复杂性理论、密码学和应用数学等领域中，因此具有广泛的实际应用领域。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization of NP-complete problem, the problem often similar to business, investment po
Mechanical_Vibrations
- Mechanical vibrations exercises.
tree
- 二叉排序树，实现简单的排序，删除，插入，保存，恢复等功能-Binary sort tree, the realization of a simple sort, delete, insert, save and restore functions
pmsm_motor
- 用MATLAB建立的永磁同步电机仿真模型，可以用于电机的控制和驱动仿真。-Permanent Magnet Synchronous Motor MATLAB simulation model established simulation can be used to control and drive motor.
robotSearch-1.0.tar
- matlab algorithms for robot search
yunkong
- 基于matlab的直流电机双闭环控制系统 运动控制系统-Based on the MATLAB three-phase electric double loop DC motor control system