资源列表
upload1
- 传教士与野人问题。完美版。getStrategy函数参数是N和k,返回的是一个字符串数组,代表一个状态序列,数组中的每一个元素代表一个状态,每一个状态表示为(a,b,c),其中a表示左岸的传教士数目,b表示左岸的野人数目,c表示船是否在左岸,c=1为船在左岸,c=0为船在右岸。如果问题无解,返回只有一个元素 “no solution”的数组。-Missionaries and savages the problem. Perfect version. getStrategy function p
upload2
- 八数码问题。九宫格的每一个状态用一个字符串表示,该字符串为将九宫格中的数字从上到下,从左到右的连接起来,空白处用“0”表示。初始状态表示为”123804765”-8 digital issues. Style Box for each state with a string that the string will be the number of five direction pad from top to bottom, left to right to link up the space
upload4
- 使用模拟退火算法解决旅行商问题 程序框架中的Annealing.java文件,Annealing.java实现了Inter.java接口中的函数。接口函数getStrategy是一个返回类型为void的函数,函数的输入参数是一个字符串,代表输入文件的文件名-The use of simulated annealing algorithm to solve the TSP program in the framework of Annealing.java files, Annealing.j
upload5
- 遗传算法求解旅行商问题。在n=20的情况下依然能90 以上获得正确解。-Genetic Algorithm for Traveling Salesman Problem. In the case of n = 20 can still obtain the correct solution for more than 90 .
max_relation
- 其基本原理是使图像中目标和背景的相关总量最大的阈值为最优分割阈值-This paper combines one dimension Maximal Correlative Criterion and two dimension Maximal Correlative Criterion to estimate the neuron parameters
SMO
- SVM中的序列最小最优化算法(Sequetial Minimal Optimization)。-SVM in the sequential minimal optimization algorithm (Sequetial Minimal Optimization).
BP
- 基于BP神经网络的客户流失分析分类,用java实现。-BP neural network based on customer churn analysis classification, using java to achieve.
Hopfield
- matlab使用hopfield神经网络实现数字识别,加入噪声后,也可以识别出来!-matlab neural network using the hopfield digital identification, adding noise, can also be identified!
car_brands_identified
- 使用基于matlab的神经网络,实现的汽车牌照识别。-Matlab-based neural network to realize the car brands identified.
GA2
- 遗传算法--分层遗传改进算法函数最优化。在基本遗传算法基础上假如分层概念。-Genetic Algorithms- Hierarchical Genetic Algorithm to optimize the function. In the basic genetic algorithm based on the concept that if layered.
GA1
- 遗传算法--遗传算法基本算法。遗传算法所有改进算法的基础。最基础的GA。-Genetic algorithms- the basic algorithm of genetic algorithm. Improved genetic algorithm for all algorithms. The most basic GA.
