Results 241 to 250 of about 3,122,051 (263)
Some of the next articles are maybe not open access.
A Novel Approach for Matrix Chain Multiplication Using Greedy Technique for Packet Processing
Communications in Computer and Information Science, 2011Matrix chain multiplication is one of well known application of optimization problem. There are N matrices of different size were given and we have to multiply them based on their row and column size. The order in which matrices are multiplied may change the number of computations. This shows the use of greedy technique to solve this problem in O(NlogN)
Nishant Doshi
exaly +2 more sources
Studies in Systems, Decision and Control, 2021
Michal Mańkowski, Mikhail Moshkov
exaly +2 more sources
Michal Mańkowski, Mikhail Moshkov
exaly +2 more sources
A heuristic for optimizing the multiplication of matrix chains
Proceedings of the 17th annual Southeast regional conference on - ACM-SE 17, 1979A consequence of the associative property of matrix multiplication is that the product of n matrices can be calculated in (n-1)! ways. Different choices for the multiplication sequence can cause the numbers of scalar multiplications required to vary by several orders of magnitude.
Lionel E. Deimel, Tempe Ann Lampe
openaire +2 more sources
2018
This chapter is devoted to the study of matrix chain multiplication problem. For this problem, we consider different cost functions and present a multi-stage optimization procedure relative to a sequence of such functions.
Hassan AbouEisha +4 more
openaire +1 more source
This chapter is devoted to the study of matrix chain multiplication problem. For this problem, we consider different cost functions and present a multi-stage optimization procedure relative to a sequence of such functions.
Hassan AbouEisha +4 more
openaire +1 more source
Matrix chain multiplication via multi-way join algorithms in MapReduce
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, 2012In this paper, we translate the multiplication of several matrices into a multi-way join operation among several relations. Matrix multiplication is widely used for many graph algorithms, such as those that calculate the transitive closure. These algorithms benefit from the multi-way join operation because this operation reduces the number of binary ...
Jaeseok Myung, Sang-goo Lee
openaire +1 more source
Information Security Using Chains Matrix Multiplication
2012Information technology is facing lots of problems, while transmitting sensitive data and confidential data due to rapid growth of technology. The sensitive data is intended to share between only authorized persons, not for all. Information security concentrates on sensitive knowledge pattern that can be exposed when extracting the data.
Ch. Rupa, P. S. Avadhani
openaire +1 more source
Memory Optimized Dynamic Matrix Chain Multiplication Using Shared Memory in GPU
2020Number of multiplications needed for Matrix Chain Multiplication of \( n \) matrices depends not only on the dimensions but also on the order to multiply the chain. The problem is to find the optimal order of multiplication. Dynamic programming takes \( O\left( {n^{3} } \right) \) time, along with \( O\left( {n^{2} } \right) \) space in memory for ...
Girish Biswas, Nandini Mukherjee
openaire +1 more source
Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions
2011In this paper, we present a methodology to optimize matrix chain multiplication sequentially relative to different cost functions such as total number of scalar multiplications, communication overhead in a multiprocessor environment, etc. For n matrices our optimization procedure requires O(n3) arithmetic operations per one cost function.
Igor Chikalov +2 more
openaire +1 more source
2017 International Conference on High Performance Computing & Simulation (HPCS), 2017
We are interested in an easy combinatorial optimization problem having several applications in the real world, namely the matrix chain product problem that may be solved by a well known dynamic programming algorithm (DPA). Our contribution is two-fold.
Khaoula Bezzina +2 more
openaire +2 more sources
We are interested in an easy combinatorial optimization problem having several applications in the real world, namely the matrix chain product problem that may be solved by a well known dynamic programming algorithm (DPA). Our contribution is two-fold.
Khaoula Bezzina +2 more
openaire +2 more sources
IEEE Transactions on Computers, 2016
With growing demands in real-time control, classification or prediction, algorithms become more complex while low power and small size devices are required. Matrix multiplication (direct or transpose) is common for such computation algorithms. In numerous algorithms, it is also required to perform matrix multiplication repeatedly, where the result of a
Taras Iakymchuk +4 more
openaire +1 more source
With growing demands in real-time control, classification or prediction, algorithms become more complex while low power and small size devices are required. Matrix multiplication (direct or transpose) is common for such computation algorithms. In numerous algorithms, it is also required to perform matrix multiplication repeatedly, where the result of a
Taras Iakymchuk +4 more
openaire +1 more source