搜索资源列表
Othello
- 使用java编写的GUI的黑白棋游戏，搜索算法采用经典的博弈树，并在此基础上做了大量优化，我的评估函数采用了Simon M. Lucas 和 Thomas P. Runarsson 在其合作发表的 Temporal Difference Learning Versus Co-Evolution for Acquiring Othello Position Evaluation 中通过对比即时差分学习（TDL，Temporal Diffe
POL-localization
- 基于差分进化和粒子群优化算法的混合优化算法，并且有查分算法的原理介绍。-Based on differential evolution and the particle swarm optimization algorithm hybrid optimization algorithm, and the principle of grey or algorithm is introduced.
Differential-evolution-algorithm
- 查分进化算法，一种新兴的优化计算方法，算子，流程，基本原理.-Differential evolution algorithm
MGDE
- 这是一个改进的查分进化算法，相应的论文为：An improved differential evolution with novel mutation strategy. 发表在IEEE 2014 Symposium on differential evolution (SDE)-This is an improved differential evolution. The corresponding paper is:An impro
差分进化算法
- 是一种高效的全局优化算法。它也是基于群体的启发式搜索算法，群中的每个个体对应一个解向量(It is an efficient global optimization algorithm. It is also a swarm based heuristic search algorithm, and each individual in the swarm corresponds to a solution vector)