A neighborhood decoupling algorithm for truncated sum minimization
MetadataShow full item record
There has been considerable interest in heuristic method for minimizing multiple-valued logic functions because exact methods are intractable. This paper describes a new heuristic, called the neighborhood decoupling (ND) algorithm. It first selects a minterm and then selects an implicant, a two step process employed in previous heuristics, e.g., Besslich  and Dueck and Miller . The approach taken here more closely resembles the Dueck and Miller heuristic; however, it makes more efficient use of minterms truncated to the highest logic value. The ND-algorithm was developed in conjunction with HAMLET , a computer software created at the Naval Postgraduate School for the purpose of designing heuristics for multiple-valued logic minimization. In this paper, we present the algorithm, discuss the implementation, show that it performs consistently better than others and explain the reason for its improved performance.
The article of record as published may be found at http://dx.doi.org/10.1109/ISMVL.1990.122611Published in: Proceedings of the Twentieth International Symposium on Multiple-Valued Logic
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Huang, Jo-Wen (Monterey, California: Naval Postgraduate School, 2017-06);With the development and advancement in the technology of control and multi-robot systems, robot agents are likely to take over mine countermeasure (MCM) missions one day. The path planning coverage algorithm is an essential ...
Adaptive selections of sample size and solver iterations in stochastic optimization with applicåation to nonlinear commodity flow problems Vondrak, David A. (Monterey, California. Naval Postgraduate School, 2009-03);We present an algorithm to approximately solve certain stochastic nonlinear programs through sample average approximations. The sample sizes in these approximations are selected by approximately solving optimal control ...