人脸识别测试源代码

遗传算法求解tsp文题 里面包括了执行文件-genetic algorithm tsp text that includes the implementation document

This program reads iid zero-mean unit-variance Gaussian variates

用c语言演绎“生命游戏",本世纪70年代，人们曾疯魔一种被称作“生命游戏”的小游戏，这种游戏相当简单。假设有一个像棋盘一样的方格网，每个方格中放置一个 生命细胞，生命细胞只有两种状态：“生”或“死”。-with language interpretation c Life "game", the 1970s, It had been a crazy demons known as the "Game of Life" of the games, this game is quite simple. Suppose a chessboard like the same grid, each square place a living cell, cell lives only two states : "Health" or "dead."

人工智能的经典八皇后问题,这个算法是a*算法.利用这个算法可以解决八数码,八皇后问题等 -artificial intelligence Queen"s classic 8, the algorithm is a* algorithm. Use of this algorithm can solve eight digital, 8 Queen"s problems

SVDD的工具箱，可以很好的处理一类分类问题，详见Support Vector Data Description一文-SVDD tools，can be used to process one class classification problem,for more details ,we refer to "Support Vector Data Description"

文中设计了一个3层径向基神经网络(RBFN)用于对企业的5项评价指标进行聚类分析，并与蚁群算法做了比较分析。RBFN由输入层 到隐含层采用传统的K一均值算法，隐含层到输出层通过“模2递减”学习速率的BP学习；蚁群算法根据信息素的分配能够自动调整收索 路径，从而达到数据自动聚类的目的。结果表明，与蚁群算法相比，改进RBFN具有快速收敛、自动识别奇异样本的优点，而蚁群算法 无须教师学习，并能够达到全局最优。-In this paper, we designed a 3-layer RBF neural network (RBFN) for the 5-to-business evaluation indicators cluster analysis and ant colony algorithm has done a comparative analysis. RBFN from input layer to hidden layer using the traditional K-means algorithm, hidden layer to output layer through the Mode 2 decreasing learning rate of BP learning ant colony algorithm based on pheromone can automatically adjust the allocation of land Faso path, thereby to achieve the purpose of automatic data clustering. The results showed that compared with the ant colony algorithm to improve the RBFN has a fast convergence, automatic identification of singular advantage of the sample, while the ant colony algorithm do not need teachers to learn and be able to reach the global optimum.

介绍模拟退火算法的经典资料，最后附了一些经典的例子-Describes the classic simulated annealing algorithm information, finally attached to a number of classic examples of

tutorials for learning protege(open source softwar to design the ontology)

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

SVM的讲义！具体的内容可以自己看！很详细的-SVM lectures! Specific content can look! Very detailed