Standard computer implementations of Dantzig's simplex method for linear programming are based upon forming the inverse of the basic matrix and updating the inverse ...
Abstract: The first linear programming bound is the best known asymptotic upper bound for binary codes, for a certain subrange of distances. Starting from the work of Friedman and Tillich (2005), ...
Abstract: This letter presents an easy-to-use technique for identifying lumped parameters of equivalent circuits for multiwinding transformers. The equivalent circuit helps to model ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results