资源列表
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
Dynamic-Programming
- 动态规划(dynamic programming)是运筹学的一个分支，是求解决策过程(decision process)最优化的数学方法。-Dynamic programming (dynamic programming) is a branch of operations research, decision-making process is the solution (decision process) mathematical optimization methods.
Floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm.
Probabilistic-algorithm
- 此算法功能强大，可以解决好多线性规划问题，同时解决许多，简单易懂，好用-This algorithm is powerful, can solve a lot of linear programming problems, while addressing the many, easy to understand, easy to use
svmmy
- 该程序是结合john 的smo伪码，和网上其他程序写的。 特别是john 的smo伪码没写出来的部分，有点搞不懂，那一部分的a1old和a2old好像有点混乱。程序大部分能运行出来，有时很久没出来。-MATLAB SMO
paper[1].tar
- 代价敏感支持向量机学习材料，里面有很多不同的方法。-MATLAB CSSVM
High-integer-operations
- 一个高位整数计算的demo，将整数设置为1000进制，然后利用链表来保存每一个数位来，在对其进行相应的计算。-A high integer calculations the demo, the integer is set to 1000 hex, then use the list to save the number of bits each, in its calculations accordingly.
Prime
- prime算法实现，求图的最短路径，算法课的作业-prime algorithm, find the map of the shortest path algorithm homework assignment
RealTimeViewer
- matlab to show stock situation
monituihuochenxu
- 基于matlab的运用模拟退火算法寻找最优路径的代码源程序-Use matlab-based simulated annealing algorithm to find the optimal path to source code
GeneralHashFunctions_-_Object_Pascal
- General Purpose Hash Function Algorithms Library -General Purpose Hash Function Algorithms Library
Test_ShortPath
- 贝尔曼福特 和 迪杰斯特拉 单源最短路径算法的实现-single source shortest path algorithm，Bellman Ford and Dijkstra