text category

MATLAB的遗传算法工具-MATLAB genetic algorithm tool

用A*算法解决八数码问题的小程序，特别好的程序代码-With A* algorithm to solve the problem of a small digital 8 procedures, in particular, a good code

双峰和多峰函数最大值的遗传算法求解 利用基本遗传算法的思路寻找双峰或多峰函数的最大值，选择采用轮盘选择方法；-Bimodal and multimodal function of the genetic algorithm the maximum use of the basic idea of genetic algorithm to find bimodal or multi-peak function of the maximum wheel options to choose from

C＋＋编写的机器学习算法 Lemga is a C++ package which consists of classes for several learning models and generic algorithms for optimizing (training) the models-prepared by the machine learning algorithm Lemga C is a package which con sists of classes for several learning models an d generic algorithms for optimizing (training ) the models

关于多目标规划的算法，是个好东西，快来下载吧-On the multi-objective programming algorithms, is a good thing, Come to download it

遗传算法优化小波神经网络的源程序,供研究设计使用-Genetic algorithm optimization of wavelet neural network source for research designed to use

支持向量机中的JAVA程序 初学者可以方便使用-Support Vector Machine in the JAVA program for beginners can easily use

神经网络已经得到广泛应用，这里是一个模糊神经网络的matlab程序-Neural network has been widely used, there is a fuzzy neural network matlab program

此编码是一个数据挖掘的决策树各种算法。以作为入门提示-this code is a decision tree data mining algorithms. As a portal to suggest

禁忌搜索法对初始解、邻域个数及禁忌列表的大小等参数有比较严格的要求, 这些参数直接影响着算法的优化能力。文章提出了一种改进的禁忌搜索法, 它用有效空间来压缩搜索范围, 这样可以提高搜索效率和全局搜索能力。用短期和长期禁忌列表存储器来保证算法能搜索到全和分局空间的每一点, 并且不重复搜索。经过验算析, 证明它是一种较好的全局启发式搜索法.-Tabu search method, the initial solution, neighborhood and tabu list size of the number of parameters such as have more stringent requirements, these parameters directly affect the ability to optimize the algorithm. This paper presents an improved tabu search method, it is used effectively to compress the search space, so that can improve search efficiency and global search capabilities. Short-term and long-term memory tabu list to ensure the algorithm can search the whole and the sub-space, each point, and do not repeat the search. After checking analysis to prove that it is a good global heuristic search method.