Search - multiply

Search - multiply - List

[Other] 动态规划矩阵连乘 DL : 0: 矩阵连乘。输出所需最小连乘次数和计算序列。使用的是动态规划算法。-matrix continually multiply. The required minimum output frequency and continually multiply calculated sequence. Using the dynamic programming algorithm.
Date : 2008-10-13 Size : 853byte User : 轩哥哥
[Other] 稀疏矩阵的运算器 DL : 1: 稀疏矩阵的运算器 [基本要求] 以“带行逻辑链接信息”的三元组顺序表表示稀疏矩阵，实现两个矩阵相加、相减、相乘的运算。稀疏矩阵的输入形式采用三元组表示，而运算结果的矩阵则以通常的阵列形式列出。这是出自清华大学　严蔚敏　吴伟民　编著的数据结构题集（C语言版）的第136页的实习4 -sparse matrix operations for the [basic requirements] "OK logical link with information" of the order form ternary group said Sparse matrix, Matrix achieve two together, subtract, multiply arithmetic. Sparse Matrix input form using ternary group, which runs the Matrix while the usual array listed. This is from Qinghua University, Yan Wei Min Xiulan WU Weimin compilation of the data structure that sets (C-language version) of the actual 136 XI 4
Date : 2008-10-13 Size : 4.83kb User : snow
[Other] PollardRho DL : 0: 大数分解算法,根据算法设计分析高级教程,随机算法章节里面所讲的,mentocarlo算法改造的大数分解,能将一个大的合数分成几个素数的相乘,可以判断这个和数是不是由素数组成-factoring algorithm, algorithm design and analysis Senior Guide, randomized algorithm inside chapters have said, mentocarlo majority of the transformation algorithm decomposition can with a large number divided into several prime numbers multiply, This can be judged not by the several-several components
Date : 2008-10-13 Size : 8.82kb User : jackcuijarod
[Other] 动态规划----矩阵连乘问题 DL : 0: 动态规划----矩阵连乘问题动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(i<j)表示矩阵Mi连乘到Mj的最小工作量 3）下方元素Di,j(i>j)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub - problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the known clusters.
Date : 2008-10-13 Size : 26.38kb User : 莫非