论文信息 - High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)

High-performance algorithm for Boolean function minimization: the partitioned incremental splitting of intervals (PISI)

This paper presents a new algorithm for the minimization of Boolean functions: the Partitioned Incremental Splitting of Intervals (PISI). This algorithm permits a high performance distributed implementation with a high speedup with relation to the original ISI algorithm, and an acceptable increase in the Boolean function representation complexity. Experimental results illustrate the main characteristics of the technique proposed.

[1] R. G. Bennetts,et al. Introduction to Switching Theory and Logical Design , 1981 .

[2] Anthony Skjellum,et al. A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard , 1996, Parallel Comput..

[3] S Fuhrman,et al. Reveal, a general reverse engineering algorithm for inference of genetic network architectures. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[4] Junior Barrera,et al. Automatic Programming of Morphological Machines by PAC Learning , 2000, Fundam. Informaticae.

[5] E. Dougherty,et al. Multivariate measurement of gene expression relationships. , 2000, Genomics.

[6] Edward R. Dougherty,et al. Modeling temporal morphological systems via lattice dynamical systems , 2001, IS&T/SPIE Electronic Imaging.