An efficient algorithm for the multiple constant multiplication problem
碩士 === 國立交通大學 === 電子工程學系 === 85 === In this thesis, we propose an efficient solution for the multiple constant multiplication (MCM) problem. Regarding the matrix as a spring , the algorithm aims at adjusting the spring into its most rela...
Main Authors: | Chen, Michael, 陳正泰 |
---|---|
Other Authors: | Jing-Yang Jou |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68702215048818524094 |
Similar Items
-
An efficient algorithm for the multiple constant multiplication problem
by: Chen, Michael, et al.
Published: (1997) -
Efficient Algorithms for Constant Multiplications and Their Hardware Implementation
by: Ping-Chang Jui, et al.
Published: (2015) -
An Efficient Outer Space Algorithm for Generalized Linear Multiplicative Programming Problem
by: Hongwei Jiao, et al.
Published: (2020-01-01) -
Multiple Constrained Shortest Path Problems
by: Tai-Chang Chen, et al.
Published: (2005) -
The Algorithm of Constant Efficiency Tracking for Fast Charging
by: Chen, chi-sheng, et al.
Published: (2009)