资源列表
olsr
- OLSR- is a link state Routing, that uses the shortest path which is preferable first.
communications-of-ACM-201001-dl
- ACM通讯 由美国计算机协会出版的学习刊物-communication of ACM Computer association published by the American learning publications
deadlock_b1994445152006
- Deadlock Algorithm for Operating Systems
EM
- EM算法正确收敛性的探讨，用于在图像处理中图像分割时应用EM，而算法有时不收敛的情况。-The EM Algorithm Convergence of the correct application of the EM for image processing in image segmentation algorithm sometimes does not converge.
graham
- Graham扫描算法 ： 大体思路是将不是凸包顶点的点从点集中去掉。 找出S中具有最小y坐标的点p（通过选取最左边的点打破平局） 根据点和p的连线 与 x轴正方向所成的角度，对S中的点进行排序（由小到大），并将p放在最前面。 从p点开始扫描排序后的S集合。如果这些点都在凸包上，则每三个相继的点p1,p2,p3满足以下性质：p3在向量<p1,p2>的左边.如果出现相继的三个点p1,p2,p3不满足上述性质，则p2点一定不是凸包的顶点，应立即去除。-Grah
clothing-sizes.cpp
- THIS CODE TAKE A PERSON S SIZEZ AS INPUT, AND OUTPUTS HIS/HER S CLOTHING SIZES
coins-change.cpp
- This code takes cents as input, and converts them to change coins.
DFS.cpp
- This code do depth first search algorithm. Adjacency matrix symbolize every edge in the graph, for example adj[i][j]=1 is an edge from i to j, i and j are vertices.
DFS-with-edges.cpp
- This code do Depth First Search and marks every edge as Back Edge, Forward Edge, Tree edge and Cross edge.
Various--algorithm-is-compared-
- 稳定性比较，时间复杂性比较，辅助空间比较-Stability be, time complexity comparison, assisted the space is
TANXINSUANCA
- 介绍ACM 介绍ACM 介绍ACM 介绍ACM 介绍ACM 介绍ACM -Interduce ACM
MultipleSkylines
- multiple skyline algorithm