用C++ Builder的分形程序，包括一个分形生物。

包分类算法Hypercuts算法，包分类算法Hypercuts算法-Hypercuts

SVM-light Version llf_dqy_hhu

水木清华BBS精华区－－人工智能 涉及了人工智能的多个方面问题-Shuimu Tsinghua BBS essence District-- AI Artificial Intelligence involves a number of aspects

是一个非常全面的pso的程序，有16个函数的测试，并且用三维图形将寻优过程显示出来。对所有的参数都可以修改测试-Is a very comprehensive procedure for the PSO, there are 16 function testing, and using three-dimensional graphics optimization process will be displayed. For all the parameters can modify the test

关于人工智能传教士和萨维奇的详细情况，请参阅拟议修正案。

提供了深度优先搜索,广度优先搜索,添加启发信息的最小代价搜索,查找多个解,查找最优解的范例程序.-a depth-first search, breadth- first search, add the information inspired the minimum price for a search of solutions to search, find out the optimal solution sample programs.

这是一篇关于pso利用的文章 也许对搞人工智能的的同学有很大的用处-This is an article on the PSO may use to engage students in artificial intelligence have great usefulness

使用遗传算法求解邮递员问题，从而可以同时求得多个最优解-The use of genetic algorithm postman problem, which can be obtained at the same time more than the optimal solution

一个使用Java实现的人工智能的图搜索策略程序――酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Search Strategy-- Liquor JiuGongTu problems of artificial intelligence-map search strategy- Demonstration Program-use guide in the field of artificial intelligence, the implicit search of the plan to solve the problem is one of the basic methods, the procedures through the use of multiple map search strategy, the rearrangement JiuGongTu problem solving, presentation of the "breadth- first search," "depth-first search", "bounded depth-first search", "best-first search" and "partial selection of the best search" five basic map search strategy. The whole process of using animation, interface design aesthetic friendly, easy to use.

本文件为遗传算法的工具箱，包括遗传算法的各种选择、交叉、变异等算法。-This document is for the genetic algorithm toolbox, including a variety of genetic algorithm selection, crossover, mutation and other algorithms.