An isomorphic notation is introduced to switching circuits which gives a one-to-one correspondence between the equation and the implementation. The application of nested parentheses makes the notation suitable for pro...
详细信息
An isomorphic notation is introduced to switching circuits which gives a one-to-one correspondence between the equation and the implementation. The application of nested parentheses makes the notation suitable for programming. It maintains essentially the ordinary algebraic equation form and may facilitate the development of more minimization theorems.
This paper is primarily concerned with finding, in the most efficient possible way, the set of all solutions to a cyclic prime implicant table. (A solution is a set of rows such that every column contains at least one...
详细信息
It is well known that the covering problem can be formulated as a system of linear inequalities together with a linear expression to be minimized;a technique for simplifying this system of inequalities is analyzed. Sp...
详细信息
The redundancy optimization problem is formulated as an integerprogramming problem of zero-one type variables. The solution is obtained making use of an algorithm due to Lawler and Bell. Objective function and constr...
详细信息
A linear classifier based on linearprogramming which is adaptive to a change in the set of input vectors is discussed. Different from other linear classifiers, this one maintains the maximum reliability of its operat...
详细信息
A linear classifier based on linearprogramming which is adaptive to a change in the set of input vectors is discussed. Different from other linear classifiers, this one maintains the maximum reliability of its operation, provided that the set of pattern vectors is linearly separable. A procedure of deriving an optimum structure of the linear classifier for a change in the set of input vectors is a modification of the ordinary simplex method and yields an optimum structure in much fewer iterations than the straightforward application of the ordinary simplex method does. The adaptive procedure is then extended to the case in which a linear classifier maintains the minimum number of erroneously classified input vectors even if the set of input pattern vectors is not linearly separable. This is based on Gomory's algorithm for integer linear programming. The feasibility and efficiency of these linear classifiers are computationally proved by some examples.
暂无评论