自已用C++写的手势辨识,可分出四个不同的手势。

用A形算法寻找迷宫的最短路径,VC实现,非常值得一看-A fractal algorithm used to find the shortest path maze, VC achieve, very worth a visit

本程序实现了多城市的tsp问题（即旅行商问题）的遗传算法-the process of multi-city tsp (ie, the traveling salesman problem) Genetic Algorithm

粒子群算法工具箱，有DEMO程序，可以对16中常见函数测试，并附有神经元网络的训练算法-Particle swarm optimization toolbox, there are DEMO program, you can test for 16 common functions, together with the training algorithm for neural networks

文件中包含某老师关于智能优化计算课程中的遗传算法部分的讲义，其中包含详细的例子及源代码。-File contains a calculation of the teachers on the intelligent optimization of the genetic algorithm curriculum part of the lecture, which includes detailed examples and source code.

基于VC++的小波提升程序，包含小波提升的详细算法。对初学者有很大帮助-Based on VC++ The Wavelet Lifting procedures, including detailed algorithm Wavelet Lifting. Have a great help for beginners

利用OPenCV写的一个hough变换检测直线的程序-OPenCV written using a hough transform line detection procedure

基于bp神经网络的货运量预测matlab实现-bp- based neural network is forecast to achieve Matlab

ClustanGraphics聚类分析工具。提供了11种聚类算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean Proximity Centroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of Squares Flexible (ß space distortion parameter) Density (or k-linkage, density-seeking mode analysis) -ClustanGraphics clustering analysis tools. Provides 11 kinds of clustering algorithms. Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean ProximityCentroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of SquaresFlexible (? space distortion parameter) Density (or k-linkage, density-seeking mode analysis)

一个用于地板厂家将不同长度的地板装箱的自动配比程序，输入各种型号的地板，会用智能算法计算出最佳装箱方案。程序帮助中有详细的说明。-floor for a different length of the manufacturers are packing the floor ratio of the automatic procedures importation of various models on the floor will use intelligent algorithms to calculate the optimal loading of the program. Program to help with detailed explanations.