搜索资源列表
比Boyer-Moore更快的字符串查找算法
- 比Boyer-Moore更快的字符串查找算法-than the Boyer - Moore string search for a faster algorithm
alg
- SUN公司专门的运筹学（or）开发库 Java算法库——查找和排序 -Sun special operations research (or) for the development of algorithms for Java -- Search and Sort
fpgrowth-C
- FP-GROWTH算法的C代码,可以成功查找所有的频繁项集合-FP-GROWTH algorithm in C code, you can be successful all the frequent item sets
PathFinder2D
- a星路径规划，各种方式的实现，用于二维路径查找算法，（包括使用数组，链表，堆的实现）各种搜索算法-a path-planning, the realization of various ways, for two-dimensional path search algorithms, (including the use of arrays, linked lists, Stack achieved) search algorithm
vc-pso
- 基于粒子群优化算法，通过多次叠代查找函数的最优项目
yiqun
- 蚁群算法：用来进行路径设计、查找、规划等
Apriori_Trie
- 数据挖掘的aprior算法，发现数据，查找如超市数据-Aprior Algorithm used in Data Mining, Data Discovery, for example, mining Super Market Data
java蚁群算法
- 本代码是基于java语言，通过蚁群算法的实现了对最优路径查找的功能。
search
- 迷宫搜索 ，A*算法 ，自动生成迷宫矩阵，查找最短路径-Maze search, A* algorithm, automatic generation of matrix maze to find the shortest path
MIT_AI_lec_02
- 麻省理工人工智能讲义2 关于人工智能领域相关数据结构，查找算法-MIT AI Lecture 02 search algorithm (tree graph ect.) Search plays a key role in many parts of AI. These algorithms provide the conceptual backbone of almost every approach to the systematic exploration of altern
tsp_ga
- 查找附近的最优解的遗传算法的TSP的使用-Find the optimal solution near the TSP' s use of genetic algorithms
astar
- 这是一个用C++编写的迷宫路径查找程序，使用GCC编译，用VC++也可以编译。程序使用A*算法，A*算法在人工智能领域是非常经典的算法，本程序对于学习A*算法非常有用。-This programme is wroten by C++, using GCC compile it.The algorithm is A*,syntax is C++.A* algorithm is classic algorithm when you learning AI.
8digits
- 人工智能实验中的八数码游戏，通过A*算法查找最优路径-Artificial intelligence experiment eight digital games, by A* algorithm to find the optimal path
apriori
- 先验概率算法--apriori.包括频繁项的查找和关联分析的算法。具体请参看源码。-Priori probability algorithm- apriori. Including frequent finding and association analysis algorithms. Please refer to the specific source.
IntervalTree
- 本工程实现了算法导论书中区间树查找的算法，可直接运行。-Find the interval tree
E2LSH-0.1
- 局部敏感哈希算法进行数据查找和召回。可以实现最近邻查找、局部敏感哈希算法查找，并且比较两者的召回率。-Local sensitive hashing algorithm to find and recall data. Find the nearest neighbor can be achieved, local sensitive hash algorithm to find and compare the recall.
Hungarian-Algorithm.
- 函数查找最小边的权重匹配给出的M×N的边缘 使用匈牙利算法权重矩阵的权重 A function for finding a minimum edge weight matching given a MxN Edge weight matrix WEIGHTS using the Hungarian Algorithm. - A function for finding a minimum edge weight matching given a MxN Edge we
fPGrowth
- 利用fpgrowth算法，进行相关词查找。其中利用支持度和置信度控制输出数据质量(Using fpgrowth algorithm, related word search. The support and confidence are used to control the quality of output data)
kmkuv
- 查找第k小元素算法的实现,很实用的一个算法程序,欢迎大家下载()
常用问题的算法
- 常用问题的算法，包括表达式求值，递归二分查找，归并算法，回溯法求解数独问题等(The commonly used algorithms, including recursive expression evaluation, two search, merging algorithm, backtracking and Sudoku problem etc.)