资源列表
Trie
- trie 树 什么是 trie 树 ？ ◇ trie 树是一种用于快速检索的多叉树结构。 ◇ 和二叉查找树不同，在 trie 树中，每个结点上并非存 储一个元素。 ◇ trie 树把要查找的关键词看作一个字符序列。并根据 构成关键词字符的先后顺序构造用于检索的树结构。 ◇ 在 trie 树上进行检索类似于查阅英语词典。 一棵 m 度的 trie 树或者为空，或者由 m 棵 m 度的 trie 树构 成。-data structure
ActivityUnit6Page080
- Learnin Mathematics with the ABACUS Activity-book part 6
Fluent_gambit
- Optimus Fluent Gambit
lagrangian_mechanics
- MODERN TECHNIQUES OF POWER SPECTRUM ESTIMATION BY C. BINGHAM, M. D. GODFREY, and J. W. TUKEY Reprinted from IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS Volume AU-15, Number 2, June 1967 pp. 56-66 Copyright c 1967 { The Institute
25811214svm_v251
- LibSVM工具箱，在matlab环境下实现，完整的与VC接口！更多访问个人主页：http://huangbo929.blog.edu.cn-LibSVM toolbox in Matlab environment achieved, and the integrity of the VC interface! More personal visit Home : http://huangbo929.blog.edu.cn
Taxi-route--based-on-multi-agent
- 基于多Agent的机场场面最优滑行路径算法-Taxi route optimization algorithm of airport surface based on multi agent
progamming
- 各种算法比如矩阵鞍点，分划，n阶乘，螺旋阵，穿越沙漠，二分法求解方程，百鸡问题，残缺棋盘，贪心法删数，矩阵乘法动态规划。。。等等，亲测可以运行。-Various algorithms such as matrix saddle point, partition, n factorial, spiral array, through the desert, the dichotomy solve the equations, one hundred chicken issue, incomplet
01beibao.rar
- 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！,01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace!
simmind
- Simulation of Quartz Crystal Resonator using approximation from "Mindlin Plate"
calculator
- 初学数据结构 写的利用栈操作写得简单计算器-Beginners stack data structure write operation using a simple calculator written
multi-target-tracking-with-ms
- 基于ms的多目标跟踪的算法，对大家应该有帮助-Ms-based multi-target tracking algorithm, we should help
Image_encoderdecoder_Useing_Matlab_Peking_Univ
- Image encoder/decoder-Useing Matlab-Peking Univ.-Image encoder / decoder-Useing Matlab-Pe king Univ.