搜索资源列表
ACOforTSP
- tsp问题的群蚁算法实现，其中c为测试矩阵，代表各点的相对坐标，NC_max 最大迭代次数 ，m蚂蚁个数，Alpha 表征信息素重要程度的参数，Beta 表征启发式因子重要程度的参数，Rho 信息素蒸发系数，Q 信息素增加强度系数，R_best 各代最佳路线，L_best 各代最佳路线的长度，运行后得到最佳路线和收敛曲线-ant problem tsp algorithm group, of which c for the test matrix, the representative of
EightPuzzle
- Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank. There are 2 Heuristic: 1. N: Number of misplaced tiles 2. S: Sum o
0514003
- 根据汽车内饰等行业需求,对皮制品加工的优化排样问题进行了研究.创新地采用离散化处理方式,同时引进边界约束,使排样过程与皮料和样片的几何信息无关,使用基于顺序的启发式底左布局将样片顺次布置到皮料上-According to the demand for such industries as automotive interior trim, leather processing for optimal layout problem is studied. Innovative approach o
q
- 通过一系列贯穿于章节间的有趣难题，本书深入浅出的阐述了如何利用计算机来求解问题的一些现代启发式方法。-Through a series of inter-sections through the interesting problems, this book set out in simple terms how to use computers to solve the problem of modern heuristic methods.
src
- 人工智能中的八数码难题 这个采用的是广度优先以及启发式算法 -Artificial intelligence in the digital challenge of the eight is used, as well as breadth-first heuristic
AIsearchproblem
- 对于通常的九宫问题（八数码）的一个解决方案，程序中实现的三种搜索算法——深度，广度，启发式-Nine-palace for the usual problems (8 digital) of a solution, and procedures to achieve the three search algorithms- depth, breadth, heuristic
EmpiricalResearchofVolatilitySpillover
- 论文首先介绍了行为金融学对完全信息假设的摒弃。接着利用启发式判断准 则推断了波动传递的起源。同时跨市交易者无意中造成了波动的传递。最后详细 阐述了羊群行为的产生机理和市场表现，分析了羊群行为对波动溢出的放大效应。 -First of all papers presented on behavioral finance to abandon the assumption of complete information. Then infer the use of heuristic c
eightnumber
- 人工智能的期末课程设计，实现了AI部分，用启发式搜索查找最短路径-Artificial intelligence at the end of curriculum design, the realization of part of the AI, using heuristic search to find the shortest path
NachOS-4.1
- Nachos的全称是“Not Another Completely Heuristic Operating System”，它是一个可修改和跟踪的操作系统教学软件。它给出了一个支持多线程和虚拟存储的操作系统骨架，可让学生在较短的时-Nachos is the full name of " Not Another Completely Heuristic Operating System" , which is a modification of the operating sys
NNHTSP
- a nearest neighbor heuristic solving travelling salesman problem. it is great. h-a nearest neighbor heuristic solving travelling salesman problem. it is great. hehehhehehhee
opt4j-2.0
- Java平台的启发式优化算法，包含了多目标进化算法（SPEA2和NSGA2），多目标差异进化，PSO和单目标模拟退火算法。并且包含了ZDT,DTLZ和WFG等测试函数-Opt4J is a framework for applying meta-heuristic optimization algorithms to arbitrary optimization problems. The Opt4J framework currently includes a multi-obje
JULIEI
- 用MATLAB进行时间序列分析,聚类分析和启发式算法一些介绍。个人收集，很有价值-Using MATLAB to carry out time series analysis, clustering analysis and heuristic introduction. Personal collection, great value
DHP1
- 双启发式近似动态规划的程序，对研究近似动态规划很有帮助-dual heuristic dynamic programming
qifa
- nod32 的启发式分析，检测未知病毒技术的白皮书。-nod32 heuristic analysis to detect unknown virus technology, the White Paper.
zmg
- A* 算法实现走迷宫通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系-A* algorithmthrough the preparation of the maze procedure to skillfully master A* algorithm.* A full understanding of algorithms and heuristic function of
fire
- 模拟退火算法是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。本文给出了该算法的详细介绍和伪代码。-Monte-Carlo simulated annealing algorithm is based on a heuristic iterative method for solving stochastic search process. This paper gives a detailed descr iption of the algorithm and pseudo code.
8_puzzle
- 8数码问题的Java求解，采用A*算法。数据结构采用的Vector<int[]>。输出为"no solution"或一系列表示求解过程的字符串。 某些30步的测试样例需要半分钟左右，但是绝对是正确解~~万望您能不吝点滴时间耐心等待……orz thnx~~ 我用的启发函数计算了现在的网格距离目标网格还有多远。 具体算法是，将每一格中的数字的坐标与其应该在的坐标的差加到一起，得到这个最终值h(x) 也就是Manhattan_Distance 源码使用
AA2
- This file includes a heuristic to solve the problem of shortest path between two given vertices of a graph, with a limited amount of max length allowed before passing through a vertex of a special set.
20070903
- 三维装箱问题的组合启发式算法。目前最有效的解决三维装箱问题的方法。-Three-dimensional bin-packing problem a combination of heuristic algorithm. The most effective solution to three-dimensional packing problem.
Algorithm_of_Karge_Thompson
- Karge Thompson算法的MATLAB源程序。-The algorithm of Karge Thompson is a heuristic algorithm that allows to obtain, given a specific group of jobs to be produced, the best sequence in terms of time setup.