Programmable-logic-array (PLA) optimization can be achieved by using heuristic two-level switching-function minimization algorithms. The authors introduce a novel approach to the heuristic-switching-function minimization, formulating the problem as a state-space search. Several heuristic evaluation functions are used to guide the search, which is realized by constructing a binary decision tree.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Kabakçioḡlu et al. (2003) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: