模式识别中人连识别眼镜定位，用的是matlab支持向量机开发的...

利用竞争学习进行模式分类实例-using competitive learning example for pattern classification

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

fortran 语 言 编 写 基 本 遗 传 算 法 源 程 序 fortran Genetic Algorithms written by FORTRAN

仿真人工智能是指用人工的方法和技术，模仿、延伸和扩展人的智能，实现机器的智能化，人工情感指用人工的方法和技术，模仿、延伸和扩展人的情感，使机器具有识别、理解和表达情感的能力。

自适应小生境递阶遗传算法求解函数优化问题 想对其他函数求解就修改function函数-adaptive hierarchical genetic algorithm optimization function to function for the other amendments on the funct ion function

【全美经典】小波十讲（Ingrid Daubechies 著）中文版- [ Entire American classics ] wavelet ten lectures (Ingrid Daubechies) Chinese edition

神经网络和遗传算法在水科学领域的应用-neural networks and genetic algorithms in the field of water science applications

利用窗体实现堆排序。并能逐一显示堆排序的过程-Using the form to achieve Heap Sort

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

这是一篇关于文本分类问题的综述，详细的介绍了文本分类的技术发展。-text category