搜索资源列表
EinghtQueen
- 八皇后问题的求解 本程序是在java平台上开发完成 -8 Queen of the procedure is to solve the java platform developed
zhuigan
- 追赶法，可以求解三对角 矩阵，非常可靠，经过本人多次验证-chasing method can solve three-diagonal matrix, very reliable, after I repeatedly verified
myknapsack
- a) 0-1背包问题采用的是动态规划法,该算法思想简介如下: 有些问题常常没有办法把它们分成较小数目的子问题，在这种情况下，可以试着把问题分成必要多的子问题，每个子问题又可以分成数目不确定的必要多的子子问题，这样就会产生大量的子问题。如果分得的子问题界限不清，互相交叉，则在大量的子问题中会存在一些完全相同的子问题，因而在解这类问题时，将可能重复多次解同一个子问题。这种重复当然是不必要的，避免的方法可以在解决一个子问题后把它的解（包括其子子问题的解）保留下来，若遇到求解与之相同的子问题的时候，
questionofvector
- 解决一个矩阵问题。具体的问题看文件说明。和源码。-solve a matrix problems. Look at specific problems documented. And the source.
XGetopt_demo
- XGetopt Windows下的Getopt兼容函数 解决了LINUX下程序向WINDOWS命令行程序部分移植问题-XGetopt the Getopt Windows compatibility function to solve the Linux way Preface to the Windows command line procedures of Transplantation
HW2.rar
- we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.,we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic pro
Josephe2
- 数据结构中经典的约瑟夫问题的解决算法。简单易懂-Data structure in the classical algorithm to solve the problem of Joseph.
juzhen3.1
- 动态规划解决矩阵连乘问题 算法设计与分析实验题-With dynamic programming to solve the matrix multiplication problem
IIsfixer
- IIS 有问题 可以用他修复！可以解决很多棘手的问题！-IIS can be a problem with his restoration! Can solve many difficult issues!
viterbi1.0
- 维特比算法，一种动态规划算法，用来求解隐马尔科夫模型-Viterbi algorithm, a dynamic programming algorithm to solve the Hidden Markov Model
Astarfindpath
- 用A star算法来解决寻路问题，程序简单易实现。给定几种不同的地图进行验证，得到较优的路径-A star algorithm used to solve the routing problem, the procedure is simple and easy to achieve. Given several different maps to verify the path to be better
GA
- 本程序运用了遗传算法，解决了以数组为数据结构的最优路径选择问题。-This procedure using genetic algorithm, to solve the array data structure for the selection of the optimal path.
solveCongurence
- Solve Congurence problem with this code
Recursivesolve
- 递归函数编程的优点时简单 但耗用空间很大 由于频繁的调用函数 时间耗用也很可观 这个算法可以在空间和时间上解决递归函数的缺点 -The advantages of recursive functions when programming simple but frequent consumption is much room for the call function as a result of time spent in this algorithm is also very good in
banker
- 一个银行家演示程序，源于操作系统中死锁的解决问题，采用TC编写，使用了带有颜色的输出，易于理解。该程序写于大二时期，程序中多有冗余漏洞，请见谅。-A banker demo program, from the operating system to solve the problem of deadlock, using TC preparation, use of color output with easy to understand. The program was written in
hamilton_20
- 贪心和回溯算法来求解HAMILTON回路，可求解20以内-Greedy and backtracking algorithms to solve HAMILTON loop can be solved within 20
Josephus
- 解决约瑟夫问题的一个较为简单的例子的源代码。-Joseph problems to solve a relatively simple example of the source code.
sequencejosephus
- 代码采用顺序表的存储方法解决约瑟夫问题。-The code sequence-table storage method to solve the problem, Joseph.
Businessmen_Crossing_SRC
- 解决商人渡河问题。该问题为：有三个商人，三个强盗，和一条船（船每次只可以载小于等于两个人）他们同在河的一边，想渡过河去，但是必须保证在河的任何一边必须保证商人的数目大于等于强盗的数目，并要满足渡河次数尽可能的少，应该怎么过这条河呢？ -To solve business problems crossing. The problem is: There are three businessmen, three robbers, and a boat (each boat can only c
solve-the-equation-root
- Dichotomy method to solve the equation root Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "二分法求解方程的根", "二分法求解方程的根\二分法求解方程的根.vcxproj", "{D9669C97-34C5-4009