Efficient Algorithms for the Ensemble Computation Problem

Ensemble Computation (EC) is an optimization problem to find the least operations sequence to calculate all of the given multiple monomials. EC can be applied to simplify the logic circuits, and to the optimization of the compiler. In this paper, we suggest efficient algorithms for EC. By the comput...

Full description

Saved in:
Bibliographic Details
Published inIntelligent Informatics and Biomedical Sciences (ICIIBMS), International Conference on Vol. 7; pp. 235 - 240
Main Authors Ikenaga, Yujiro, Yamaguchi, Kazuaki
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE 24.11.2022
Subjects
Computational efficiency
Greedy algorithms
Informatics
Logic circuits
Optimization
Real-time systems
Search problems
Online AccessGet full text
ISSN2189-8723
DOI10.1109/ICIIBMS55689.2022.9971517

Cover

More Information
Summary:Ensemble Computation (EC) is an optimization problem to find the least operations sequence to calculate all of the given multiple monomials. EC can be applied to simplify the logic circuits, and to the optimization of the compiler. In this paper, we suggest efficient algorithms for EC. By the computational experiments, we compared an algorithm based on Beam Search (BS) with an algorithm derived from the compression algorithm Re-Pair. Experimental results show that the BS based algorithm produces better solutions although it is slower than the Re-Pair based algorithm.
ISSN:2189-8723
DOI:10.1109/ICIIBMS55689.2022.9971517