Search - matrix chain multiplication

Search - matrix chain multiplication - List

[Data structs] Matrix_Chain DL : 0: 求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.
Date : 2025-07-02 Size : 1kb User : 韩希先
[JSP/Java] MatrixDynamicMulti DL : 0: 用动态规划实现矩阵链乘的java代码-Dynamic Programming Matrix chain by the java code.
Date : 2025-07-02 Size : 1kb User : andy
[Data structs] matrix_mult DL : 0: 矩阵链的相乘的源代码，采用动态归还算法求解得到最优解。-chain matrix multiplication of the source code, the return of dynamic algorithm to obtain the optimal solution.
Date : 2025-07-02 Size : 1kb User : 李明
[Other] SimpleDataStruct DL : 0: 小弟初学者，简单数据结构：包括单链表逆置，对陈矩阵相乘，分解单链表，分块查找，交换左右自述，模式匹配，二叉排序树、删除子串，冒泡排序等-younger beginners, a simple data structure : single-chain including inverse home, Chen matrix multiplication, single-chain decomposition. Search Block, exchange around the readme, pattern matching, binary tree sort, delete substring, Bubble ranking
Date : 2025-07-02 Size : 89kb User : HuiCong
[Windows Develop] MatrixChain DL : 0: Date : 2025-07-02 Size : 186kb User : 王鹏
[Windows Develop] MatrixChain DL : 0: 矩阵连乘的经典问题.给顶一系列的矩阵,要求它们的乘积.由于矩阵乘法满足结合律,因此不同的结合将导致不同的效率,本程序寻求一个最佳的矩阵结合,使之获得最高的运算效率-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
Date : 2025-07-02 Size : 9kb User : Lotus Year
[Data structs] report+of+Algorithm DL : 0: 算法设计的实验报告包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm
Date : 2025-07-02 Size : 28kb User : 苏宁
[Windows Develop] Matrixchainmultiplication DL : 0: 给定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
Date : 2025-07-02 Size : 3kb User : 晶
[Windows Develop] mcm DL : 0: this a matrix chain multiplication ...in c code-this is a matrix chain multiplication ...in c code
Date : 2025-07-02 Size : 2kb User : satendra
[source in ebook] juzhen DL : 0: 动态规划实现矩阵链相乘使用动态规划，实现矩阵链的相乘，减少了代价-Dynamic programming to achieve matrix-chain multiplication
Date : 2025-07-02 Size : 1kb User : haozhanzhu
[Other] JUZHEN DL : 0: Description 给定一个有N个矩阵的矩阵链A1A2A3...An，矩Ai的维数为pi-1*pi。我们都知道，使用朴素的矩阵乘法去乘两个维数分别为x,y和y,z的矩阵，所需要的乘法次数为x*y*z。矩阵链乘法问题就是如何对矩阵乘积加括号，使得它们的乘法次数达到最少。 Input 输入的第一行为一个正整数N(1<=N<=200)。表示矩阵的个数。输入的第二行包含N+1个整数，分别表示pi(0<=i<=N)，其中每个pi在[1,200]范围内。 Output 输出一个整数表示最少要进行的乘法次数。 -Description Given a matrix N a matrix chain A1A2A3 ... An, moments Ai dimension of pi-1* pi. We all know that the use of simple matrix multiplication to multiply two dimensions, respectively x, y, and y, z matrix, the required number of multiplication x* y* z. Matrix-chain multiplication problem is how to add the product to the matrix in parentheses, allowing them to reach a minimum number of multiplication. Input input first acts of a positive integer N (1 < = N < = 200). Indicated that the number of matrices. Enter the second line contains N+1 integers, respectively, indicated that pi (0 < = i < = N), where each pi in [1,200] range. Output output, said at least one integer number multiplication to be carried out.
Date : 2025-07-02 Size : 397kb User : 王泽萌
[Mathimatics-Numerical algorithms] MCM DL : 0: Matrix chain multiplication
Date : 2025-07-02 Size : 1kb User : kilroy
[Algorithm] juzhenliancheng DL : 0: 动态规划中的矩阵链乘。。有需要的可以看下-Dynamic programming matrix-chain multiplication. . Need may have a look
Date : 2025-07-02 Size : 1kb User : zhang peng
[ELanguage] matMultRecur DL : 0: this code is used for parallel programming(a matrix multiplication with recursion)
Date : 2025-07-02 Size : 1kb User : honda
[SCM] mcm DL : 0: Matrix chain multiplication in c
Date : 2025-07-02 Size : 1kb User : Smita Naval
[Algorithm] Matrix-Chain_JAVA DL : 0: 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.
Date : 2025-07-02 Size : 1kb User : Justas
[Data structs] zoj-1094 DL : 0: zoj的ACM模拟测试题，第1094道：矩阵链乘测试时为0ms通过-The ACM test of zoj，1094：Matrix Chain Multiplication
Date : 2025-07-02 Size : 9kb User : mzdbskipop
[Data structs] The-matrix-the-chain-multiplication- DL : 0: 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm.
Date : 2025-07-02 Size : 1kb User : 吕子乔
[Printing program] Chain DL : 0: my code compute matrix chain multiplication
Date : 2025-07-02 Size : 737kb User : mohandesi
[Algorithm] matrix-chain DL : 0: Matrix Chain Multiplication
Date : 2025-07-02 Size : 54kb User : Pardeep Kumar

« 12 3 »