搜索资源列表
tspwithKL
- this tar includes my code which employ the Lin-Kernighan algorithm to address the tsp problem. this tar also include some testfiles and config file and a readme which describes how to run this program.
evaluat_max
- 关于演化算法的小程序.以一个二元二次方程的求极值为例.对输入参数作了简化的固定处理.较好的说明了演化算法.可直接运行.-on evolutionary algorithm small procedures. A binary quadratic equation for the extreme example. To simplify the input parameters fixed address. A good note evolutionary algorithm. Direct op
pickup_filebody
- 在信息检索中，对网页进行处理，得到网页的文本主体。-in Information Retrieval, the website address, the text to be the main website.
KMEANS_FixedBug
- 经典的K均值分类算法源码，修正了原作者没有处理当类中样本为0的情况下的bug-classic K-mean classification algorithm source code, that the original author did not address when the category 0 samples of the bug
beyeshi
- 贝叶斯决策解决城市最短路径问题,人工只能实验项目-Bayesian decision-making to address the urban shortest path, artificial only pilot projects
demos
- This manual describes how to run the Matlab® Artificial Immune Systems tutorial presentation developed by Leandro de Castro and Fernando Von Zuben. The program files can be downloaded from the following FTP address: ftp://ftp.dca.fee.unicamp.br/pu
SimulatedAnnealingtosolveTSPproblem
- 这段代码使用了模拟退火的思想解决TSP问题。在这个仿真实验中解决了自定义的20个城市的TSP问题，在设定合适参数后每次的运行中都能得到一个比较理想的结果-This code uses the idea of Simulated Annealing to solve TSP problem. In this simulation experiment to address the custom of the 20 city TSP problem, set the appropriate para
GAPSO
- GA 用于配送中心，工厂等的选址，采用遗传算法，在程序中可以选择不同的编码方法。-GA CHOOSE ADDRESS
ImproveAdaline
- 用于解决数字识别问题的神经网络实现，使用java语言实现。-To address the digital identification problem for neural networks, using java language.
yiqunsuanfa
- 该文件是蚁群算法程序，能更有效地解决路径问题，希望可以给广大朋友起到一定的作用。-The program file is the ant colony algorithm can more effectively address the routing problem, hope to play a role in the general friend.
kalman_filtering_theory_and_practice
- 讲kalman滤波器的书，理论结合实践，附有matlab代码-kalman_filtering_theory_and_practice, address kalman filters, matlab codes for each chapters attached.
contacts1
- 利用线性表实现一个通讯录管理，通信录的数据格式如下： struct DataType { int ID //编号 char name[10] //姓名 char ch //性别 char phone[13] //电话 char addr[31] //地址 } 要求： ? 实现通讯录的建立、增加、删除、修改、查询等功能 ? 能够实现简单的菜单交互，即可以根据用户输入的命令，选择不同的操作。 ? 能够保
TSP
- 遗传算法解决TSP问题代码，其为了解决30个城市行走的最佳路径-Code genetic algorithm to solve TSP problems, and its 30 cities to address the best path to walk
3
- 我们小组研究的关于遗传算法在实际中的应用-Specifically address the numerical conversion of relatively simple mathematical logic, can solve the problem for beginners
ant-colony-algorithm-demo
- 功能强大的蚁群算法演示平台，能针对基本的蚁群算法，改进后的蚁群算法在TSP等问题上进行相关演示-Powerful ant colony algorithm demo platform, can address the basic ant colony algorithm, the improved ant colony algorithm in TSP and other issues related to demo
Divide-and-conquer-algorithm
- 分治算法是基于多分枝递归的一种算法设计模式。分治算法递归地把一个大问题分解为多个类型相同的子问题，直到这些子问题足够的简单能被直接解决。最后把这些子问题的解结合起来就能得到原始问题的解。-Divide and conquer algorithm is based on a multi-branch recursive algorithm design pattern. Divide and conquer algorithm recursively to a large problem into
Immune-optimization-algorithm
- 实现选址问题的免疫优化算法，从遗传算法衍化过来，但是效率更高-Immune optimization algorithm for address
ppy
- 一个简单的网络爬虫，在一个网页里面找个每个老师的详细信息的地址，然后访问该地址，把这位老师发表的论文的 时间 名字 期刊 的信息找出来，然后把这些信息存入mysql中-A simple web crawler in the inside of a web page to find more information on the address of each teacher, then access to the address to find out the time the name of
AdvanceEditDistance
- 编辑距离算法的详尽实现，是文本聚类的很好解决途径，解决了经典编辑距离的弊端，在vc6.0下实现，能处理大规模文本，速度快，效率高。-Edit distance algorithm detailed implementation is a good text clustering solutions to address the shortcomings of the classical edit distance, in vc6.0 to achieve, can handle large-sc
coevolutionary-algorithm
- 协同进化算法[I5] (Co-Evolutionary Algorithm, CEA)是研究者在协同进化理论基础 上提出的一类新算法。这类算法强调了种群与环境之间、种群与种群之间在不断进化过 程中的协调。与传统进化算法相比较,CEA可以对待求问题解空间进行合理的种群划分, 对较大规模的问题求解能有效跳出局部最优点,寻找到更好的优化解虽然CEA研 究起步较晚,但由于它的优越性,目前己成为当前进化计算的一个研究热点。 -Existing coevoluti