By Topic

Simultaneous column minimization-encoding approach for serial decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Patil, S. ; Nevada Univ., Las Vegas, NV, USA ; Muthukumar, V.

In this paper we present an approach that combines the process of column encoding and input-output encoding. Traditionally, the process of column minimization is represented as a set covering or clique partitioning or graph coloring algorithms. These algorithms are well known NP-hard problems. The column minimization problem is followed by the input-output encoding problem, which is represented as a weighted graph assignment problem, which is again a well known NP-hard problem. The combined column minimization and input-output encoding algorithm reduces the complexity by representing both the above problems as a single weighted graph encoding problem. The proposed algorithm has been implemented and evaluated with standard benchmarks.

Published in:

Computational Intelligence and Multimedia Applications, 2005. Sixth International Conference on

Date of Conference:

16-18 Aug. 2005