搜索资源列表
mathmodel
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, downloa
simulated annealing
- 模拟退火算法求解经典图论中的图着色问题的源程序-simulated annealing algorithm classic graph coloring map of the source
Hamiton.rar
- [智能] 求完全图哈密尔顿圈的遗传模拟退火算法matlab通用源程序 ,[Intelligence] for the complete graph of the Hamilton Circle genetic simulated annealing algorithm matlab source generic
GA-based-on-the-graph-edge
- 基于遗传算法的有向图的边序列遍历算法Matlab源码.此函数实现遗传算法，用于用于有向图的边遍历序列的优化 GreenSim团队原创作品-Genetic algorithms are based on the edge to the graph traversal algorithm sequence of Matlab source code. This function implements the genetic algorithm used for edge directed graph
Spanning-tree
- 利用图论中生成树的概念编写的全部生成树代码，由于缺少中间的实数编码遗传算法代码，所以还不能得出完整的结果，但整个程序框架是正确的！-Spanning tree in graph theory using the concept of writing all the spanning tree code, the lack of the middle of the real-coded genetic algorithm code, so it can not come to a complete
FirstChange
- 人工智能博弈树学习。用户是MAX方，电脑是MIN方，实现经典的分钱币游戏的与或图盲目搜索算法。-Artificial intelligence game tree learning. MAX user side, the computer is MIN parties to achieve the classic sub-games and coins or graph blind search algorithm.
gco-v3.0
- graph cut 优化算法的最新版本，包含C++版本（在VS2005以上版本可以调通）和Matlab接口，-graph cut optimization algorithm of the latest version, includes C++ version (or later in the VS2005 can be transferred through) and the Matlab interface
883winedis_and_search
- 包括883分酒问题，图的遍历等人工智能基本算法-Including 883 hours of liquor problem, artificial intelligence, such as graph traversal algorithm
hungray
- 二分图匹配-匈牙利算法 效率很高，求二分图最大匹配。-Bipartite graph matching- Hungary algorithm highly efficient, and the maximum bipartite graph matching.
MyGA
- 我自己写的一个用于图编码的遗传算法，实现了多种算子，如选择、交叉、编译、比较等，具体的请参见源码-I wrote it myself one for the graph-encoded genetic algorithm, to achieve a variety of operators, such as selection, crossover, compile, compare and so on, see the specific source
LGE
- LGE算法（Linear Graph Embedding）用于降维，代码比较长，比较复杂。供大家研究！-LGE algorithm (Linear Graph Embedding) for dimensionality reduction, code longer, more complicated. For everyone!
OLPP
- 正交的Linear Graph Embedding算法！用于降维，供大家学习交流。-Orthogonal Linear Graph Embedding Algorithm! For dimensionality reduction for them to learn from the exchange.
Dijkstra
- Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
109201262ruby_allocation3
- 算法图论-Algorithm for Graph Theory
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
yiqun
- 蚁群算法是一种用来在图中寻找优化路径的机率型技术，该算法具有许多优良的性质，具有一种新的模拟进化优化方法的有效性和应用价值， 是一种求解组合最优化问题的新型通用启发式方法，可以解决一维静态优化问题甚至多维动态组合优化问题。 -Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technology, the algorithm has many goo
GraphCut_matlab
- graph cut 优化算法的最新版本，包含和Matlab接口，已编译，以及自己的一个简单测试例子程序MyTest，还有一篇经典论文及自己的读书笔记-graph cut optimization algorithm of the latest version, includes and Matlab interface has been compiled, and their example of a simple test program MyTest, there is a classic
Ant-colony-algorithm
- 蚁群算法(ant colony optimization, ACO)，又称蚂蚁算法，是一种用来在图中寻找优化路径的机率型算法。-ACO (ant colony optimization, ACO), also known as ant algorithm is a method used to find the optimal path in the graph the probability-based algorithm.
Graph-Coloring(HGA)
- 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
Graph
- 人工蜂群算法，ABC，最优解，最优路径，随机产生的路径中找到最优的解(Practical Application of Artificial Bee Colony Algorithm)