Proposal of Two Efficient Algorithms for the Ensemble Computation Problem

DOI

Bibliographic Information

Other Title
  • Ensemble Computation問題に対する二つの発見的解法の提案

Abstract

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. We proposed two methods, an algorithm based on Backward Search (BS), and an algorithm derived from the compression algorithm Re-Pair. By the computational experiments, we compared these methods. Experimental results show that the Re-Pair based algorithm produces better solutions although it is slower than the BS based algorithm.

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top