Description: 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least. Platform: |
Size: 1024 |
Author:韩希先 |
Hits:
Description: 由于矩阵连乘不同结合方式的运算工作量很不一样. 工作量相差也非常大；所以要寻找一种最佳的结合方式, 然后再执行矩阵乘法运算-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 the implementation of matrix multiplication Platform: |
Size: 1024 |
Author:小康 |
Hits:
Description: 给定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 pi-1pi, on the product A1A2 ... An order to minimize a scalar multiplication method increases the number of all brackets. The problem by using dynamic programming algorithm Platform: |
Size: 3072 |
Author:晶 |
Hits:
Description: 动态规划计算矩阵组成的乘法，是算法分析的练习，有助于掌握动态算法-Calculation of the composition of dynamic programming matrix multiplication, the algorithm for the analysis of practice, help to grasp the dynamic algorithm Platform: |
Size: 2048 |
Author:张一鸣 |
Hits:
Description: 包括4个算法问题：
1、船的最大载重
2、动态规划货郎但问题
3、符号三角形
4、MPI矩阵相乘问题-Including the four algorithm problem: one, the ship' s maximum load 2, dynamic programming street vendor but the question three, symbols triangle 4, MPI matrix multiplication problem Platform: |
Size: 3072 |
Author:mao |
Hits:
Description: 动态规划中的矩阵链乘。。有需要的可以看下-Dynamic programming matrix-chain multiplication. . Need may have a look Platform: |
Size: 1024 |
Author:zhang peng |
Hits:
Description: 矩阵连乘：矩阵的连乘，利用动态规划算法解决次序问题-Multiplicative matrix: matrices with multiplication, the order of the dynamic programming algorithm to solve the problem Platform: |
Size: 167936 |
Author:赵莉 |
Hits:
Description: 功能：动态规划应用。内容:动态规划求矩阵连乘时所需乘法最小次数。-Dynamic programming matrix multiplication with the minimum required number of multiplication. Platform: |
Size: 1024 |
Author:韦伟彬 |
Hits:
Description: 各种问题算法，包括，N皇后问题回溯算法，动态计算网络最长最短路线，货郎担界限，矩阵乘法动态规划等-Algorithm for various problems, including, N Queens problem backtracking algorithm, dynamic network of the longest shortest path computation, Traveling Salesman boundaries, such as dynamic programming matrix multiplication Platform: |
Size: 23552 |
Author:赵明臣 |
Hits:
Description: 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 dimension pi-1 x pi, fully parenthesize the product A1A2...An in a way that minimizes the number of scalar multiplications. Platform: |
Size: 1024 |
Author:Justas |
Hits:
Description: 功能为实现动态规划的矩阵连乘，可以运行，适合用于课程设计-Functions to achieve dynamic programming matrix with multiplication, you can run, suitable for curriculum design Platform: |
Size: 172032 |
Author:闫养鑫 |
Hits:
Description: 给定n个矩阵{A1,A2,…,An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。要算出这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积。本文的功能是采用动态规划算法，给出矩阵的一种最优的加括号方式，是计算量最小。-Given n matrices {A1, A2, ..., An}, where Ai and Ai+1 is a mere of, i = 1,2, ..., n-1. To calculate the n matrix with the product A1A2 ... An. Since matrix multiplication to meet with law, so the calculation of the matrix with the product can have many different calculation order. This calculation can be bracketed in order to determine ways. Even if the product of a matrix calculation to determine the complete sequence, that the product is fully bracketed with, so you can call the order of 2 repeated the standard matrix multiplication algorithm to calculate the matrix with the product. This feature is the use of dynamic programming algorithm, a matrix is given in parentheses best way is to calculate the minimum amount. Platform: |
Size: 13312 |
Author:阿四 |
Hits:
Description: C语言实现动态规划 矩阵连乘问题！
问题：给定n个矩阵{A1,A2,…，An}，其中Ai与Ai+1是可乘的，i=1,2,…,n-1。计算这n个矩阵的连乘积。由于矩阵乘法满足结合律，故计算矩阵的连乘积可以由许多不同的计算次序。计算次序不同计算连乘积的计算量也不同。运用动态规划法思想给出你认为合理的计算矩阵连乘积最少次数的方案。-C language dynamic programming matrix continually multiply problems!
The problem: given n matrix {A1, A2, ..., An}, where Ai and Ai+1 is multiplicative, i = 1,2, ..., n-1. Calculating these n matrix product. Law, the calculation of the matrix with the product of order by many different computing Since matrix multiplication meet combined. Calculating order of different computing connected multiplied by the amount of calculation is also different. Given that you think that the reasonable calculation matrix with the product of at least the number of programs using dynamic programming thought. Platform: |
Size: 1024 |
Author:杨晨 |
Hits:
Description: 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm. Platform: |
Size: 1024 |
Author:吕子乔 |
Hits:
Description: 动态规划算法实现的矩阵乘法，这个算法在很多ACM竞赛中经常出现的题目-Dynamic programming matrix multiplication algorithm, the algorithm in many ACM contest that often appear in the title Platform: |
Size: 1024 |
Author:xielei |
Hits:
Description: 各种算法比如矩阵鞍点，分划，n阶乘，螺旋阵，穿越沙漠，二分法求解方程，百鸡问题，残缺棋盘，贪心法删数，矩阵乘法动态规划。。。等等，亲测可以运行。-Various algorithms such as matrix saddle point, partition, n factorial, spiral array, through the desert, the dichotomy solve the equations, one hundred chicken issue, incomplete chessboard, delete a few greedy method, dynamic programming matrix multiplication. . . And so on, pro-test to run. Platform: |
Size: 247808 |
Author:张潇 |
Hits:
Search - dynamic programming matrix multiplication