搜索资源列表
chenbo广度
- 人工智能运用广度优先算法来解决八数码问题,由初始状态到目标状态按层搜索-breadth priority use of artificial intelligence algorithms to solve eight digital issue, the initial state to the target state by layer Search
20051004深度优先 人工智能 八数码
- 人工智能中很重要的思想，用深度优先的思想解决八数码问题。-AI is very important idea, with priority to the depth of eight digital thinking to solve problems.
8数码A算法
- 设计说明：1。数据结构和表示：程序用1、2、3、4分别表示将右、上、左、下的数字块移动到空格之中。采用典型的树+链表结构，每种局面产生一个BoardState类。出于避免走法顺序列表被过多复制的考虑，在树结构中保存局面的继承关系。每种新的局面产生后，引用估值函数产生f的值，再根据大小将其插入链表之中，以便实现“优先展开f值小的节点”。Solve()函数在成功解决问题之后保存一个走法序列供输出并返回零，而失败则返回失败处的节点层数。(具体的判断方法见后文)-Design Notes : 1. Da
GA----GeneticAlgorithms
- 遗传算法vb实现代码，快去看看吧。也许你会用到的-genetic algorithm to achieve vb code, a matter of priority, let's see it. You may use the
ChessEight
- 解决八数码问题的经典程序。实现了宽带优先算法，深度优先算法，A* 算法。图形化显示结果。-solve the classic problem of the digital process. Broadband achieved priority algorithm, depth-first algorithm, A * algorithm. Graphic shows results.
宽度优先
- 宽度优先搜索法见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.
bashuma
- 分别用深度优先和广度优先来算八数码问题，c++源码-Were depth-first and breadth of the priority issues to count eight digital, c++ source code
arit
- c++开发的无优先级运算问题-增量式搜索，回溯-剪枝的策略-c++ development of non-priority operation problem- incremental search, back- the pruning strategy
HeapSort
- 最大堆的生成、堆排序，以及一个简单的最大优先队列的实现。-The largest generation heap, heap sort, as well as a simple realization of the greatest priority queue.
gaul-devel.tar
- http://gaul.sourceforge.net/ 这里大部分人讨论的是在Matlab里实现GA的toolbox.以上为一个GA的C语言的软件包.如果你想利用GA做优化算法,非常有用.而且有很多example.方便起见,我把软件包附件. -http :// gaul.sourceforge.net/most of the people here are discussed in Matlab GA achieve the toolbox. More than a GA C langu
TheNumberOfTimeSlicesBasedOnPrioritySchedulingAlgo
- 基于优先数的时间片轮转调度算法处理器调度（方法一）-The number of time slices based on priority scheduling algorithm processor scheduling rotation (method A)
Intelligent-pathfinding-algorithm
- 关于智能寻路，网络上也有很多相关的文章，一般都是已A*为主，他只是一种启发式搜索，主要还是做一个智能路径搜索的算法。 -About the intelligent pathfinding, network also has A lot of related articles, are generally have A * give priority to, he is just A heuristic search, the main or do A intelligent search alg
4[1]
- 提出了一种新的模糊遗传算法(GA)的方法来解决问题的轨迹规划两个合作共享一个公共的机器人避障工作场所,在机械手必须考虑对方作为一个移动的轨迹或者行为障碍是未知的和不可预知的,因为每一个都有各自的目标和机械手都有相同的优先权。 -This paper presents a novel fuzzy genetic algorithm (GA) approach to tackling the problem of trajectory planning of two collaborat
search1
- 最优优先算法，用最优优先算法进行搜索，VC平台编写，直接运行即可-Optimal priority algorithm, the optimal first algorithm to search for the VC to write, direct run
process_schedulingg
- FIFO，优先数调度算法，时间片轮转调度算法的实现，经调试可运行 -the realise of FIFO, priority number of scheduling algorithms, time slice, round robin scheduling algorithm.
enkf-matlab-0.30.tar
- 集合卡尔曼滤波的Matlab程序，enkf-matlab-0.30，最新版本-EnKF-Matlab is designed primarily as a research and study tool. As a consequence, speed and memory usage are given a lower priority than simplicity and ease of use
priority-based-method-
- robocup rescue 机器人救援仿真参考论文 非预案方式下警力分配模型的研究与仿真（基于优先级的警察智能体的构建方法，周诚）-robocup rescue robot rescue simulation mode reference paper non-plan allocation model of police and Simulation (priority-based method of constructing the police agent, Zhou Cheng)
shortest-route-problem
- 最短路径问题的四种实现方式:广度优先、深度优先、贪心法、动态规划法、穷举法、回溯法。-Four ways to achieve the shortest path problem breadth priority greedy depth-first dynamic programming method exhaustive backtracking
罗马尼亚
- 分别用宽度优先、深度优先、贪婪算法和 A*算法求解“罗马利亚度假问题”。(We use width priority, depth first, greedy algorithm and A* algorithm to solve the "roo Maria holiday problem".)