资源列表
Backbag
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization problem of NP complete. Problems can be described
delnumber
- 利用c++算法解决算法设计与分析中的删数问题-solve the delete-number problem by c++
face_detection_matlab
- Face Find in the matlab
shortest_path
- 关于图论与网络流当中一种有效的寻找最短树形图的算法-On graph theory and network flow in an effective achievable short tree algorithm to find the most
dataparticaloptimizationanalysis
- matlab数据分析，优化、回归以及基本算例-analysis optimization for matlab users
nonlinear-alignment-method
- 捷联惯导四元数误差模型，采用ukf作为滤波方法。-nonlinear alignment method for sins
xianzhen
- 线列阵波束形成指向性仿真,通过改变方位角，观察不同方位线列阵指向性-Linear array beamforming directional simulation by changing the azimuth, observed the different orientation of line array directivity
MatlabClassicSourceCodes
- matlab经典算法的程序：规划问题，插值与拟合，解方程，数据分析，绘图等。内含程序源码及教学课件
ssc_Li_cell_20121127
- 电池电量估计-ssc_lithium_cell_1RC.mdl- This model implements a lithium cell equivalent circuit using one parallel RC branch. This model automatically loads the parameter values stored in the file "ssc_lithium_cell_1RC_ini.m". You can change between pulse
er
- 续上一个数据结构的课件，讲解内容为四到六章，有代码讲解。-Continued courseware on a data structure to explain the contents of four to six chapters, with the code to explain.
osu-svm
- OSU-SVM，基于LibSVM但是不需要LibSVM的格式，可以在32位的电脑上运行，速度较快，比较稳定，欢迎试用。-OSU-SVM, based on LibSVM but not LibSVM format, 32-bit computer can run faster, more stable, welcomed the trial.