Location:
Search - MatrixChain
Search list
Description: MatrixChain问题，java 中经典问题-MatrixChain, java classical problem
Platform: |
Size: 859 |
Author: 华瑞 |
Hits:
Description: 《算法分析与设计》中的 “矩阵连乘程序”给定n个矩阵｛A1,A2,…,An｝，其中Ai与Ai+1是可乘的，i=1,2 ,…,n-1。由于矩阵满足乘法的结合律，根据加括号的如何确定计算矩阵连乘积的计算次序，使得依此次序计算矩阵连乘积需要的数乘次数最少。
Platform: |
Size: 8300 |
Author: li |
Hits:
Description: 算法导论例题的实现，矩阵连乘。自己写的，质量一般
Platform: |
Size: 271345 |
Author: tangWH |
Hits:
Description: 分治法求矩阵链乘法中的各个矩阵相乘的最优次序
Platform: |
Size: 8116 |
Author: 王鹏 |
Hits:
Description: 动态规划法解矩阵连乘积的最优计算次序问题。按照分解最优解的结构，建立递归关系，计算最优值，构造最优解4个步骤
Platform: |
Size: 1004 |
Author: 忠波 |
Hits:
Description: 用动态规划法
对连乘矩阵求解最少相乘次数
并求出解
Platform: |
Size: 953 |
Author: 林燕 |
Hits:
Description: 矩阵连乘的经典问题.给顶一系列的矩阵,要求它们的乘积.由于矩阵乘法满足结合律,因此不同的结合将导致不同的效率,本程序寻求一个最佳的矩阵结合,使之获得最高的运算效率
Platform: |
Size: 9753 |
Author: Lotus Year |
Hits:
Description: MatrixChain问题，java 中经典问题-MatrixChain, java classical problem
Platform: |
Size: 1024 |
Author: 华瑞 |
Hits:
Description: 《算法分析与设计》中的 “矩阵连乘程序”给定n个矩阵｛A1,A2,…,An｝，其中Ai与Ai+1是可乘的，i=1,2 ,…,n-1。由于矩阵满足乘法的结合律，根据加括号的如何确定计算矩阵连乘积的计算次序，使得依此次序计算矩阵连乘积需要的数乘次数最少。
Platform: |
Size: 241664 |
Author: li |
Hits:
Description: 算法导论例题的实现，矩阵连乘。自己写的，质量一般-Example Introduction to the realization of algorithm, matrix even by. Wrote it myself, the quality of general
Platform: |
Size: 493568 |
Author: tangWH |
Hits:
Description:
Platform: |
Size: 190464 |
Author: 王鹏 |
Hits:
Description: 动态规划法解矩阵连乘积的最优计算次序问题。按照分解最优解的结构，建立递归关系，计算最优值，构造最优解4个步骤-Dynamic programming solution matrix product even calculate the optimal order problem. Optimal solution in accordance with the decomposition of the structure, the establishment of recursion relations to calculate the optimal value, the optimal solution structure 4 steps
Platform: |
Size: 1024 |
Author: 忠波 |
Hits:
Description: 用动态规划法
对连乘矩阵求解最少相乘次数
并求出解-Using dynamic programming method for solving matrix even at least multiplied by the number of obtained solutions
Platform: |
Size: 1024 |
Author: 林燕 |
Hits:
Description: 矩阵连乘的经典问题.给顶一系列的矩阵,要求它们的乘积.由于矩阵乘法满足结合律,因此不同的结合将导致不同的效率,本程序寻求一个最佳的矩阵结合,使之获得最高的运算效率-Matrix even by the classic problems. To the top of a series of matrices, their product requirements. As a result of matrix multiplication to meet the combination of law, it will lead to a different combination of different efficiency, the procedures to seek an optimal combination of matrix, and thus obtain the highest computing efficiency
Platform: |
Size: 9216 |
Author: Lotus Year |
Hits:
Description: 问 题：矩阵连乘问题
描 述：给定n个矩阵｛A1,A2,...,An｝，其中Ai与Ai+1是可乘的，i=1，2…，n-1.考察这n个矩阵的连乘积A1A2...An。矩阵A 和B可乘的条件是矩阵A的列数等于矩阵B的行数。若A是一个p x q矩阵，B是一个q * r矩阵，则其乘积C=AB是一个p * r矩阵,需要pqr次数乘。
编程任务：对于给定的相继n个矩阵{A1,A2, ..., An }及其维数，编程计算矩阵连乘积A1A2...An 需要的最少数乘次数。
-Question: Even by the issue of Matrix Description: given n matrices (A1, A2 ,..., An), which Ai and Ai+ 1 is the multiplicative, i = 1,2 ..., n-1. Visit this n Even a matrix product A1A2 ... An. Matrix A and B take the condition that the matrix A the number of rows equal to the number of rows of matrix B. If A is a pxq matrix, B is a q* r matrix, then their product C = AB is a p* r matrix, the need to take the number of pqr. Programming tasks: one after another for a given n matrices (A1, A2, ..., An) and its dimension, programming computing matrix product A1A2 ... An even needed by the number of at least a few.
Platform: |
Size: 14336 |
Author: Katherine |
Hits:
Description: 实现矩阵相乘的算法，其中有算法的详细讲解！-Implementation of matrix multiplication algorithm, which explain in detail the algorithm!
Platform: |
Size: 7168 |
Author: naoiny |
Hits:
Description: 动态规划:矩阵连乘问题的模拟程序 参考清华王晓东的<算法设计与分析>-Dynamic programming: simulation program of matrix multiplying reference Qinghua Wang Xiaodong<Algorithm Design and Analysis>
Platform: |
Size: 4096 |
Author: blch |
Hits:
Description: 可以显示矩阵链乘的最小乘法次数矩阵，和加括号方法。-Chain matrix can be displayed by the number of the most小乘法matrix, and processing methods in brackets.
Platform: |
Size: 1024 |
Author: 沈博 |
Hits:
Description: 算法设计与分析之动态规划算法，实现多个矩阵相乘-matrixchain
Platform: |
Size: 238592 |
Author: lizhuangzi |
Hits:
Description: 实验二-矩阵链乘
Description
给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。
你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。-MatrixChain dp
Platform: |
Size: 1024 |
Author: genegi |
Hits: