搜索资源列表
Matrix_Chain
- 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
MatrixDynamicMulti
- 用动态规划实现矩阵链乘的java代码-Dynamic Programming Matrix chain by the java code.
matrix_mult
- 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
SimpleDataStruct
- 小弟初学者，简单数据结构： 包括单链表逆置，对陈矩阵相乘，分解单链表，分块查找，交换左右自述，模式匹配，二叉排序树、删除子串，冒泡排序等-younger beginners, a simple data structure : single-chain including inverse home, Chen matrix multiplication, single-chain decomposition. Search Bloc
practice2.1
- 1． Matrix-chain product. The following are some instances a) <3, 5, 2, 1,10> b) <2, 7, 3, 6, 10> c) <10, 3, 15, 12, 7, 2> d) <7, 2, 4, 15, 20, 5> -1. Matrix-chain product. The following
MatrixChain
- 矩阵连乘的经典问题.给顶一系列的矩阵,要求它们的乘积.由于矩阵乘法满足结合律,因此不同的结合将导致不同的效率,本程序寻求一个最佳的矩阵结合,使之获得最高的运算效率-Matrix even by the classic problems. To the top of a series of matrices, their product requirements. As a result of matrix multiplication
Matrix+Computations
- 矩阵计算的书，矩阵计算，很好的书，希望对大家有用。-Matrix calculation of the book, matrix calculation, a very good book, in the hope that useful to everyone.
Matrixchainmultiplication
- 给定n个矩阵构成的一个链<A1,A2,…,An>其中i=1，2，…，n，矩阵Ai的维数为pi-1pi,对乘积A1A2…An以一种最小化标量乘法次数的方式进行加全部括号。该问题应用动态规划算法-N matrix of a given composition of a chain <A1,A2,…,An> Which i = 1,2, ..., n, the dimension of the matrix Ai is
mcm
- this a matrix chain multiplication ...in c code-this is a matrix chain multiplication ...in c code
juzhen
- 动态规划实现矩阵链相乘 使用动态规划，实现矩阵链的相乘，减少了代价-Dynamic programming to achieve matrix-chain multiplication
Fig10_38
- It s about matrix chain algorithm souce code
matMultRecur
- this code is used for parallel programming(a matrix multiplication with recursion)
Matrix-Chain_JAVA
- Matrix Chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has
The-matrix-the-chain-multiplication-
- 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm.
matrix-chain
- 矩陣相乘最佳化 matrix chain-matrix chain
Chain
- my code compute matrix chain multiplication
Matrix-Multipy
- 高阶的矩阵链乘，二分幂算法 Matrix chain into high-end, two power points-Matrix chain into high-end, two power points
matrix-chain
- Matrix Chain Multiplication
matrixchain
- Matrix Chain Multiply
L12
- Matrix Chain Multiply 2