AI's A

< 网络机器人java编程指南>>的配套源程序，研究如何实现具有Web访问能力的网络机器人的书。从Internet编程的基本原理出发，深入浅出、循序渐进地阐述了网络机器人程序Spider、Bot、Aggregator的实现技术，并分析了每种程序的优点及适用场合。本书提供了大量的有效源代码，并对这些代码进行了详细的分析。通过本书的介绍，你可以很方便地利用这些技术，设计并实现网络蜘蛛或网络信息搜索器等机器人程序。-lt; Lt; Java Web Robot Programming Guide gt; Gt; The matching source to study how to achieve the ability to visit the Web network robot book. Internet programming from the basic principles and simple, step by step elaborate procedures of the network robot Spider, Bot, aggregator of technology, and analysis of the merits of each procedure and applicable occasions. The book provides plenty of source code, as well as code for a detailed analysis. Through the book, you can easily take advantage of these technologies, network design and network information spider or other search engine robot procedures.

《人工神经元网络》含有实用的网络模型、学习规则和训练方法的一些算法程序，对学习人工智能，模式识别的人有一些帮助！-"artificial neural network" contains practical network model, learning rules and the training methods of some algorithm for the study of artificial intelligence, pattern recognition of some help!

TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.

销售预测系统，可以根据历史销售数据对未来的销售量进行有效预测，采用BP神经网络对预测模型进行训练，可以达到不错效果-sales forecasting system, based on historical sales data for the future effective sales forecasts, BP neural network model to predict the training, they can achieve good results

More AI...(GEP) Gene Expression Programming in C# and .NET 由Michael Gold用C#开发的GEP程序.-AI ... (GEP) Gene Expression Programming in C# and. By Michael Gold NET C# development of the GEP procedures.

基于神经网络的辨识工具箱 (527KB)-Neural Network Based Identification Toolbox (527KB)

isomap等规度映射，特征提取，机器学习-Isotacticity isomap mapping, feature extraction, machine learning

svm Main_SVR_Epsilon 用于svm回归的 在matlab中运用 -svm regression svm Main_SVR_Epsilon for use in matlab

是用遗传算法求函数：f(x1,x2)=100(x1*x1-x2*x2) (x1*x1-x2*x2)+(1-x1)(1-x1) 约束：-2.048

用贪心法解决TSP问题.输入数据可求得所要的最值的结果.-greedy algorithm used to solve TSP. Input data can be obtained by the most value to the results.