搜索资源列表
veelionAI
- 人工智能中经典算法-宽度搜索和启发是搜索（A*算法）在VC环境下的实现代码，对于学习人工智能有很多帮助- In the artificial intelligence the classical algorithm - width search and the inspiration are the search (the A* algorithm) under the VC environment realization code, has regarding the study arti
EightNumbers
- 此软件是八数码软件，图形界面操作，分别用“将牌的距离和”、“不在位将牌数”和“宽度优先搜索”求解八数码问题。-eight digital software, a graphical interface operation, "to the distance and licensing", "will not place the number of licenses" and "width Search" Solving the prob
AI-widefirst
- 八数码宽度优先搜索算法,可以找到最优解,但会消耗更多的资源.-eight digital width first search algorithm to find the optimal solution, but it will consume more resources.
JiuGongTree
- 这是有一个解决八数码问题的程序！ 主要应用了宽度优先搜索法！ 是用C#开发的-This is a solution to the problem of digital eight procedures. Application of the width of the main priorities Search! Is the development of the C#
求解野人与传教士问题
- 求解野人与传教士问题，利用C语言实现宽度搜索算法。
Matlab_NN
- ％以FRP－混凝土面内剪切试验说明matlab神经元网络的使用 ％读入试验数据，数据格式为 ％ FRP厚度(mm) FRP宽度(mm) FRP粘结长度(mm) FRP弹模(GPa) 混凝土抗拉强度(MPa) 混 凝土宽度(mm) ％[ 0.169 50 130 97 2.9 100] ％网络输出为极限承载力
EIGHTNUM
- 八数码 大家看看就知道了 宽度搜索 怎么非得够20个子呢？
宽度优先
- 宽度优先搜索法见cpp1.cpp文件，在vc6.0环境运行实现-width priority search see cpp1.cpp documents in the operation to achieve environmental vc6.0
SearchWidth
- 人工智能里的图搜索技术，以宽度优先为搜索策略。-artificial intelligence search technology plans to give priority to the width search strategy.
shortest_path_Digraph.rar
- 采用宽度优先遍历法，构建邻接表有向图，解决最短路径问题。,Breadth-first traversal method used to build the adjacent table to the map, the shortest path to solve the problem.
15数码问题的3种算法(算法和具体代码)
- 15数码问题的3种算法(算法和具体代码) 解决15数码问题的3种算法，分别是深度，宽度，以及A*算法。c语言编写，VC下都通过运行。,15 digital issues three kinds of algorithm (algorithm and the specific code) to solve the problem of 15 digital three kinds of algorithms, respectively, are the depth, width, and th
ga-RBF.rar
- 基于遗传算法对rbf神经网络的径向基宽度进行优化的matlab程序,Based on genetic algorithm rbf radial basis neural network to optimize the width of the matlab program
threemethods
- 解决15数码问题的3种算法，分别是深度，宽度，以及A*算法。c++编写，VC下都通过运行。-15 digital issues to solve three kinds of algorithm, namely depth, width, and the A* algorithm. c++ prepared, VC by running under.
8Digit
- 使用了A*,A,深度优先,宽度优先等算法解决八数码，由于高强度的优化,使得运算十分之快，而且功能齐全，界面好看.是上学期俺做的人工智能作业.-The use of A*, A, depth-first, breadth-first algorithm to solve, such as eight digital, high-intensity as a result of the optimization, making a very fast operation, and full-feat
winep_code
- 这是一个典型的产生式系统的算法题.用的是有界深度优先的递归算法,是用C++Builder4.0写的.这也是人工智能或者程序设计竞赛题中最基本最常用的算法.如果自己动手编程实现了一个这样的题目,那么很多相关的题目也就都一样可以做了,比如"四皇后问题","推箱子问题","传教士和野人问题"等等。 利用深度优先的算法都是不一定能找到最优路径的,而且如果解路径过长的话还可能会搜索失败.如果保证要找到最优路径需要用另一些算法,比如宽度优先算法.无论是哪一种算法,如果问题稍微复杂一点的话,都要解决"
8digitalWidthsearch
- 经典的人工智能实验8数码宽度搜索--自河工05级计算机赵丽娜-Classic experiment in artificial intelligence 8 digital width search- 05 computer from the Hebei University of Technology Li-Na Zhao
guangdusousuo
- 宽度优先搜索算法（又称广度优先搜索）是最简便的图的搜索算法之一，这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
geneticalgrithmoptimizeRBF
- matlab源码，运用遗传算法 优化RBF隐层神经元的中心值，宽度，和权值，具有很强的学习性。-matlab source code, the use of genetic algorithm optimization of RBF hidden layer neurons in the central value, width, and weight, has a strong learning.
eight_breadth
- 用C语言实现宽度优先算法，八数码问题。作者：陈华昌-With the C language implementation breadth-first algorithm, 8 digital issues. Author: Chen Huachang
bp-assort
- 应用bp算法实现对iris数据库的分类，iris数据库是人们广泛使用的用于模式分类的实例系统。它含有150个例子，分为三类，每个类由四个实数特征值描述，分别表示萼片（sepal ）长度，萼片宽度，花瓣（petal ）长度，花瓣宽度。问题是根据这四个特性值分类三种iris 植物，输入为四个特征值和类别 （5.1 3.5 1.4 0.2 0），输出算法分类结果 -Bp algorithms applied to the iris database, the classification, iris