c++学习初步

用于求解TSP的蚁群算法，C 语言 已经运行过-Basic Ant Colony Algorithm for TSP

感知器神经元解决较复杂输入向量的分类问题-Perceptron neurons to solve more complex input vector classification

C++实现的支持向量机神经网络代码，欢迎各位使用-C realized SVM neural network code, welcome you use

一个人工神经网络BP算法源代码与演示程序-an artificial neural network algorithm source code and demonstration program

人工智能编程示例-artificial intelligence programming paradigm

该文档是清华大学的模式识别教程，该版本是网页版本，浏览非常方便，内容也非常详细，非常适合初学者，个人举得特别是支持向量机那一章描述很棒！-this document is from Tsinghua University,this is the html version,it is convenient to read, it is very suitable for the elementary readers,in my own opinion,the charter of svm is very detail and easily understandable.

这是用prolog写的几个程序：程序１是一个旅行社关系系统，程序２是一个家族关系系统，程序３是一个成绩管理系统-This is prolog written several programs : a procedure is a travel agency relations systems, procedures 2 is a family relationship systems, procedures 3 is a performance management system

针对热电厂锅炉补水水处理控制程序,用simens s224,包括多介质,反渗透,混床控制 -Water treatment for power plant boiler control procedures, and simens s224, including multi-media, reverse osmosis, mixed bed control

清华大学不确定规划教材中的模糊规划求解算法1-Tsinghua University, uncertainty in the planning of teaching materials fuzzy programming algorithm 1

已知北京、上海、广州、昆明和西安五城市航线里程如图。分别实现： 1）找到北京到昆明的最短路径。 2）找到北京到昆明，必须途径上海的路径。 3）找到北京到昆明，必须途径上海，但不能去广州的路径。 -known Beijing, Shanghai, Guangzhou, Kunming and Xi"an City route five mileage figure. Were achieved : 1) to Kunming to Beijing to find the shortest path. 2) find Beijing to Kunming, Shanghai must channel"s path. 3) to find Beijing to Kunming, Shanghai must channels, but can not go to Guangzhou"s path.