资源列表
TSptanxin
- TSP贪心算法C++ ,很有用的源代码哦-based genetic algorithm for multi- objective optimization. It is a very e® ective algorithm but has been generally criticized for its computational complexit
SVM-KM
- 今天看见一个极品 SVM工具箱，很独特，速度也快，不敢独享！ http://asi.insa-rouen.fr/enseignants/~arakotom/toolbox/index.html-Need SVM toolbox today saw a very unique and quick, not exclusive! http://asi.insa-rouen.fr/enseignants/ ~ arakotom/toolbox/index.html
BP
- BP神经网络经典代码，可执行程序，大家快下啊-Classical BP neural network code, executable programs, we quickly under ah
MyCluster
- 聚类算法中的k均值算法，里面已经包含一个文本聚类的实验。-Clustering algorithm k means algorithm, which already contains a text clustering experiments.
DMOEADD_code2009
- 动力学演化算法解决多目标优化问题，采用了与模拟退火算法相结合的准则，理论基础来源于统计力学中的自由能极小化定律。 -Evolutionary Algorithms for Solving Multi-Objective Problems
pso
- 人工智能中的PSO算法，C++编程，抄来的，可以使用。-Artificial Intelligence in the PSO algorithm, C++ programming, copied, and can be used.
newpnn
- 神经网络的经典程序，对于大家学习十分的有用，不可多得啊-Classical neural network program, very useful for them to learn, rare ah
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 基于遗传算法的背包问题求解，遗传算法，背包问题。-Based on genetic algorithm to solve knapsack problem, genetic algorithms, knapsack problem.
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，基于遗传算法的背包问题求解-Knapsack problem, genetic algorithm, based on genetic algorithms for solving knapsack problem
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题(Knapsack problem)是一种组合优化的NP完全问题, 相似问题经常出现在商业、投资组合优化、组合数学，计算复杂性理论、密码学和应用数学等领域中，因此具有广泛的实际应用领域。-Knapsack problem (Knapsack problem) is a kind of combinatorial optimization of NP-complete problem, the problem often similar to business, investment po
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，GAs，基于遗传算法求解背包问题-Knapsack problem, genetic algorithms, GAs, Knapsack Problem Based on Genetic Algorithm
Based_on_genetic_algorithm_for_solving_knapsack_pr
- 背包问题，遗传算法，GAs，基于遗传算法求解背包问题，算法-Knapsack problem, genetic algorithms, GAs, knapsack problem based on genetic algorithm, the algorithm