Optimal sequence for chain matrix multiplication using evolutionary algorithm
Optimal sequence for chain matrix multiplication using evolutionary algorithm
About this item
Full title
Author / Creator
Publisher
United States: PeerJ. Ltd
Journal title
Language
English
Formats
Publication information
Publisher
United States: PeerJ. Ltd
Subjects
More information
Scope and Contents
Contents
The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM). This problem arises in various scientific applications such as in electronics, robotics, mathematical programing, and cryptography. For CMMP the researchers have proposed various tec...
Alternative Titles
Full title
Optimal sequence for chain matrix multiplication using evolutionary algorithm
Authors, Artists and Contributors
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_3b5266ecf1d84bbdb6a79436743f877f
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_3b5266ecf1d84bbdb6a79436743f877f
Other Identifiers
ISSN
2376-5992
E-ISSN
2376-5992
DOI
10.7717/peerj-cs.395
