搜索资源列表
A的算法
- A*算法属于一种启发式搜索。它扩展结点的次序类似于广度优先搜索,但不同的是每生成一个子结点需要计算估价函数F,以估算起始结点到该结点的代价及它到达目标结点的代价的和;每当扩展结点时,总是在所有待扩展结点中选择具有最小F值的结点作为扩展对象,以便使搜索尽量沿最有希望的方向进行。 -A * algorithm is a heuristic search. It extended node in the order of priority similar to the breadth of searc
Artificial-Intelligence-EIGHT-NUMBER
- 人工智能实验 运用启发式搜索中的A*算法和A算法分别比较求解八数码问题-Artificial intelligence experiments using heuristic search in A* and A algorithms for Eight digital
heshengsuanfa
- 和声搜索算法是一和启发式的全局搜索智能算法,在许多优化问题中得到了成功应用,而且在不少优化问题上比常规的一些智能算法的性能表现更优越,并且程序实现比较简单-Harmony and heuristic search algorithm is a global search of intelligent algorithm in many optimization problems have been successfully applied, but also in many optimizati
liziqun
- 粒子群优化是一种新兴的基于群体智能的启发式全局搜索算法,粒子群优化算法通过粒子间的竞争和协作以实现在复杂搜索空间中寻找全局最优点。-Particle swarm optimization is a new global search heuristic algorithm based on swarm intelligence, particle swarm optimization algorithm by particle competition and collaboration to a