搜索资源列表
MatrixChain_c++version
- 这是算法程序中用求矩阵连乘问题的c++实现，利用了动态规划的算法-This is the procedure used for algorithm continually multiply matrices of c, using a dynamic programming algorithm
yixiesuangfa
- 动态规划＋备忘录法 求最佳矩阵连乘,觉得不错，可以看下．-+ memorandum dynamic programming method for the best matrix continually multiply, and think it's good, can see next.
矩阵连乘
- 用动态规划解矩阵连乘问题-use dynamic programming solution matrix continually multiply problems
动态规划-矩阵连乘
- 由于矩阵连乘不同结合方式的运算工作量很不一样. 工作量相差也非常大；所以要寻找一种最佳的结合方式, 然后再执行矩阵乘法运算-continually multiply matrices combining different ways of computing workload very different. The workload is also very big difference; So to find the best combination of a way, and then th
MatrixMultiply
- 算法设计与分析 王晓东版的 矩阵连乘的动态规划法和备忘录法的实现-Algorithm Design and Analysis Xiaodong version of the matrix continued by the dynamic programming method and the realization of Memorandum of Law
juzhengliancheng
- 它建立在最优原则的基础上,采用动态规划方法,可以优雅而高效地解决许多用贪心技术或分治技术无法解决的问题。因此,动态规划技术越来越成为解决许多重要的应用问题的关键技术。矩阵连乘。-It builds on the optimal basis of the principles, using dynamic programming methods, can be elegant and efficient solution to many greedy technology or using tec
DPexamples
- 动态规划分析例子，实用ACM教程：矩阵连乘，LCR,基因函数等-Examples of dynamic programming analysis, practical tutorials ACM: even by matrix, LCR, such as gene function
Matrix
- 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Matrix with x: a matrix of connection by using the dynamic programming algorithm to solve the order problem. .
20100420Matrix
- 使用动态规划算法计算矩阵连乘最佳加括号方式-Algorithm using dynamic programming matrix with by way of the best brackets
DP_MatrixChain
- 动态规划中，矩阵连乘的最少次数计算，利用VC++ 2008开发环境实现的代码源码。-Dynamic programming, the matrix with the minimum number of calculations by using the VC++ 2008 development environment to achieve the code source.
juzhenliancheng
- 矩阵连乘问题，求解连乘此数的最小次数，利用动态规划方法-Matrix multiplicative problem solving to take this number with the minimum number of dynamic programming method
Multiplicative-matrix
- 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Multiplicative matrix: matrices with multiplication, the order of the dynamic programming algorithm to solve the problem
matrixMultiply
- 功能：动态规划应用。内容:动态规划求矩阵连乘时所需乘法最小次数。-Dynamic programming matrix multiplication with the minimum required number of multiplication.
laincheng
- 功能为实现动态规划的矩阵连乘，可以运行，适合用于课程设计-Functions to achieve dynamic programming matrix with multiplication, you can run, suitable for curriculum design
jvzhenliancheng
- 矩阵连乘 动态规划问题 输出n个矩阵相乘最小的结果-printf number which is the smallest of the N-matrix
Algorithm-analysis-and-design
- 计算机实验室 内容： 1、分治法，maxmin算法 2、动态规划，矩阵连乘 3、贪心法， 1）背包问题，2）装载问题 4、回溯法，N皇后问题的循环结构算法和递归结构算法。-Computer laboratory content: 1, partition method, maxmin algorithm 2, the dynamic planning, LianCheng matrix 3, greedy method, 1) knapsack probl
juzhenliancheng
- C语言实现动态规划 矩阵连乘问题！ 问题：给定n个矩阵{A1,A2,…，An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。计算这n个矩阵的连乘积。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以由许多不同的计算次序。计算次序不同计算连乘积的计算量也不同。运用动态规划法思想给出你认为合理的计算矩阵连乘积最少次数的方案。-C language dynamic programming matrix continually multiply problems! The problem:
suanfa
- 算法实验矩阵连乘问题，八皇后问题，骑士游历问题，字符串插入“+”，求最大利润的动态规划和回溯算法-Experimental matrix multiplication algorithm even question the eight queens problem, Knight traveled problem, the string is inserted " +" , seeking to maximize profits and backtracking dynamic
Dynamic-Programming
- python实现动态规划算法，用于进行多矩阵连乘，随机化分析算法复杂度-Dynamic programming algorithm by python for metrics multipling，randomized for analyzing complexity of algorithm
GOPGX
- 动态规划分析例子,实用ACM教程：矩阵连乘,LCR,基因函数等()