搜索资源列表
eightnumbyahei0802
- 八数码难题求解程序本程序所采用的启发函数,本人不能证明它能解决任何的八数码难题,如果对于较难的问题会产生很多节点,有可能会使空间不足,所以尽量不要出太难的问题难为它.希望广大的人工智能爱好者能写出更好的启发函数.-eight digital problem solving program of the procedures used by the heuristic function, I can not prove that it can resolve any of the eight di
图搜索策略
- 一个使用Java实现的人工智能的图搜索策略程序——酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Searc
GP_VC
- 遗传规划算法的VC程序实现 智能算法：遗传规划，即关于GP的VC代码程序，在项目文件中包含了GP的程序设计代码和经典问题求解程序。可以参考该程序进行遗传规划的程序设计工作，用于自己的毕业设计中。-genetic programming algorithm for the VC program Intelligent Algorithm : genetic programming, on the VC GP code procedures, the project document conta
vwumpus
- 一个基于MFC的人工智能的巫魔问题求解，图形化界面显示。-an artificial intelligence-based MFC Witch of the devil problem solving, graphical interface shows.
BBGAVB
- 一个求解背包问题的遗传算法，该程序是基于VB平台开发的-a knapsack problem solving genetic algorithm, the program is based on the platform in the VB
vb_Calculator
- 基于遗传算法的背包问题求解，有基本的说明和代码-based on genetic algorithm knapsack problem solving, a basic descr iption and code.
gahmd
- 基于遗传算法的哈密顿问题求解，有基本的说明和代码-based on genetic algorithm Hamiltonian problem solving, a basic descr iption and code.
simulate_knapsack
- 下面是模拟退火算法的代码,使用模拟退火算法（SAA）解决0－1背包问题 -Below are simulated annealing algorithm code, the use of simulated annealing algorithm (SAA) 0-1 knapsack problem solving
8888
- 人工智能的8数码问题的求解-eight digital artificial intelligence problem solving
WindowsApplication24zhang
- 模拟退火和遗传算法混和求解车辆路径问题的程序，没有解压密码。-simulated annealing and genetic algorithms hybrid vehicle routing problem solving process, not extracting passwords.
Expected_Value_Model
- 随机问题的求解，模糊期望值模型计算程序及说明文件-random problem solving, fuzzy expectations model calculation procedures and documentation
rcc8-csp-solving
- 利用空间表示的rcc8模型进行空间推理， 解决csp问题，可以自动产生csp问题，然后解决，利用了不同的算法并且做了比较，有仿真试验。-said that the use of space rcc8 model spatial reasoning, problem solving csp. csp can be generated automatically, and then resolved, the use of different algorithms and made a comp
particle_swarm_optimization-Solve-the-TSP-problem.
- 基于粒子群优化算法（PSO）的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Based on Particle Swarm Optimization (PSO) of the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
MC-Solve
- 野人与传教士问题的求解程序，对N=3，K=2给出正确路径-Savage with the missionary problem solving procedures, N = 3, K = 2 are given the correct path
tabu_search-Solve-the-TSP-problem
- 基于禁忌搜索算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Tabu search algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
genetic_algorithm-Solve-the-TSP-problem
- 基于遗传算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Genetic Algorithm Based on 50 cities TSP problem solving can be extended to a similar NP-hard problem.
ant_colony_system-Solve-the-TSP-problem
- 基于蚁群算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Ant colony algorithm based on the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
8number
- 使用 人工智能里面的 A算法 解决八数码问题 使用C语言进行编写的-A method using artificial intelligence inside the eight-puzzle problem solving using the C language written in
MaxClique
- Miscrosoft Visula Studio .NET + C++求解最大团问题，并比较了求解最大团问题的几种算法。-Miscrosoft Visula Studio. NET+ C++ solve the maximum clique problem, and compared the maximum clique problem solving algorithms.
Unconstrained--extreme-value-problem
- 无约束一维极值问题用来确定求解极小值的搜索空间的算法-Algorithms Unconstrained one dimensional extremum problem solving to determine the minimum value of the search space