搜索资源列表
MatrixChain_c++version
- 这是算法程序中用求矩阵连乘问题的c++实现，利用了动态规划的算法-This is the procedure used for algorithm continually multiply matrices of c, using a dynamic programming algorithm
MatrixMultiply
- 算法设计与分析 王晓东版的 矩阵连乘的动态规划法和备忘录法的实现-Algorithm Design and Analysis Xiaodong version of the matrix continued by the dynamic programming method and the realization of Memorandum of Law
Matrix
- 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Matrix with x: a matrix of connection by using the dynamic programming algorithm to solve the order problem. .
Multiplicative-matrix
- 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Multiplicative matrix: matrices with multiplication, the order of the dynamic programming algorithm to solve the problem
Matrix-multiplication-problems-with
- 给定n个矩阵{A1,A2,…,An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。要算出这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积。本文的功能是采用动态规划算法，给出矩阵的一种最优的加括号方式，是计算量最小。-Given n matrices {A1, A2, ...
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
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