资源列表
2398
- 找朋友的问题的探究！acm上比较经典的一道题！快来看看把！-Looking for friends to explore the issues! acm together more classic title! Come take a look at the!
NewtonIterationMethod
- 通过使用Newton迭代法求解方程 并分析它的解法收敛性； 牛顿迭代法是比较适合用计算机来计算。 -Through the use of Newton iteration method for solving equations and analyze the convergence of its solution Newton iteration is more suitable for the computer to calculate.
sacm
- 用凌阳61板实现语音播放的程序，自带音乐，适合初学者-Sunplus board with 61 voice broadcast procedures, bring their own music, suitable for beginners
2418
- acm pku 2418算法题实现 acm pku 2418算法题实现-acm pku 2418 algorithm acm pku 2418 title to achieve the realization of algorithms title
C++shuzhisuanfa
- 这里包含了很多使用而简洁的数值算法，可以在很多场合都用到。-Here contains a lot of the use of simple numerical algorithm can be used on many occasions.
ff
- 挖矿游戏源代码 很好的哦 可以研究-Mining game source code can be studied Oh well
CRC
- c语言和delphi的crc16的求解代码-c language and delphi code to solve the CRC16
KLF
- 这是一个运用卡尔曼滤波进行目标跟踪的程序-This is a use of Kalman filter for target tracking procedures
2777
- 这是一道acmpku的题目，题号是2-This is a acmpku topic title number is 2
OntologyDevelopment101AGuidetoCreatingYourFirstOnt
- Ontology Development 101：A Guide to Creating Your First Ontology-Ontology Development 101: A Guide to Creating Your First Ontology
lcsLength
- 给定一个数组，通过快速排序法，把数组里面的数按照从小到大进行排序，即递增序列。然后用lcsLength函数找出最长递增子序列。-Given an array by quicksort method, the number inside the array from small to large in accordance with the sort, that is, incremental sequence. LcsLength function and then find the longe
3133
- pku 3133 Manhattan Wiring 连通性状态压缩DP-pku 3133 Manhattan Wiring connectivity state of compression DP