A heat quench algorithm for the minimization of multiple-valued programmable logic arrays
Dueck, Gerhard W.
Butler, Jon T.
MetadataShow full item record
imulated annealing has been used extensively to solve combinatorial problems. Although it does not guarantee optimum results, results are often optimum or near optimum. The primary disadvantage is slow speed. It has been suggested  that quenching (rapid cooling) yields results that are far from optimum. We challenge this perception by showing a context in which quenching yields good solutions with good computation speeds. In this paper, we present an algorithm in which quenching is combined with rapid heating. We have successfully applied this algorithm to the multiple-valued logic minimization problem. Our results suggest that this algorithm holds promise for problems where moves exist that leave the cost of the current solution unchanged. Key words: Multiple-valued logic, logic minimization, simulated annealing, heat quench, heuristic,
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.Computer and Electrical Engineering Journal, Vol. 22, No. 2, 1996, pp. 103-107, 1996
Showing items related by title, author, creator and subject.
Oral, Sabri Onur (Monterey, California. Naval Postgraduate School, 1991-09);The process of finding an exact minimization for a multiple-valued logic (MVL) expression requires an extensive search and enormous computation time. One of the heuristics to reduce this computation time is the Neighborhood ...
Brown, James L., Jr. (Monterey, California. Naval Postgraduate School, 1993-06);A cost benefit analysis of the Fleet Numerical Oceanography Center (FNOC) is conducted with specific attention to the Optimum Path Aircraft Routing System and the Optimum Track Ship Routing Systems. These two products out ...
Wilson, K. Craig (Monterey, California. Naval Postgraduate School, 1994-12);This thesis provides an algorithm based on marginal analysis to help CLF Supply Officers load ships with Provisions (food), High Usage Load List (HULL), and ship store stock. The algorithm is ...