FP增长树

相位编组提取直线（matlab）

此电路是一个非常简单的VHDL时序电路，通过该电路能够清楚的反应VHDL的时序原理以及最基本、最简单的应用方法、

图像特征提取以及匹配，sift代码。可用于图片检索中，同比SURF，其算法可以较好的识别图像中文字-Image feature extraction and matching, sift the code. Can be used for image retrieval, up by SURF, the algorithm can better identify the image text

来自于西南交通大学 电气工程学院的专业，电子信息工程专业的数据结构课程的实验代码。DS_1即为实验作业一，以此类推。内容从前到后含有顺序表的顺序存储，链式存储，还有栈和队列的各种基本操作。

运动目标检测与跟踪,包括目标定位,匹配与跟踪c++亲测可以使用，谢谢支持。

一个利用KDD1999数据集而完成的改进K-means聚类算法的实现.-A use of data sets KDD1999 completed to improve the K-means clustering algorithm.

ACM必备精品，先来一段比较函数。 int compare(char * c1,int s1,int e1,char *c2,int s2,int e2) { while(c1[s1]=="0"&&s1

这是一个很实用的求积分算法，自适应算法是一种很有前途的算法，特为其发展贡献绵薄之力。-This is a very practical for integration algorithm, adaptive algorithm is a very promising algorithm, special small way contribute to its development.

c++数组。一维数组的插入，删除，排序-c array. One-dimensional arrays of the insert, delete, sort, etc.

The CVRP is a hard combinatorial optimisation problem. The scenario is that a set of depots contains goods to be delivered to customers by a fleet of trucks. Each customer wants a certain integer amount of goods called their demand and each truck can only carry a certain amount called its capacity. All trucks have the same capacity. The objective is to find a set of routes, one for each truck, which minimises the total distance travelled by all trucks (the  请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报