Abstract: The delay-insensitive minterm synthesis (DIMS) method facilitates a robust two-level asynchronous implementation of dual-rail encoded arbitrary combinational logic. However for multilevel realization, logic decomposition becomes indispensable. In this context, this paper describes an elegant technique of performing quasi-delay-insensitive logic decomposition based on set theoretic pri...

The examples published by Klee and Minty in 1972 do not preclude the existence of a pivot rule which will make the simplex method, at worst, polynomial. In fact, the continuing success of Dantzig's method suggests that such a rule does exist. A study of known examples shows that (a) those which use selective pivot rules require exponentially large coe cients, and (b) none of the examples' pivot...

The article discusses a two-stage method of minimizing Boolean functions for designing digital combinational circuits. At the first stage, search simple conjuncterms is carried out by bitwise division set initial conjuncterms. this way tautology does not appear, low-rank are found without intermediate gluing. second minimal performed chain coverage table In cyclic part, fragments found, which q...

An algorithm is presented for updating the LU factors of an « X n matrix A, when A is changed by a matrix of rank one. The algorithm is based on the repeated use of triangular operations, and stability is obtained by allowing both row and column pivoting. The cost of the algorithm is approximately proportional to the maximum permitted depth for the pivot search. For well-conditioned matrices a ...

Implementations of the Simplex method differ only in very specific aspects such as the pivot rule. Similarly, most relaxation methods for mixed-integer programming differ only in the type of cuts and the exploration of the search tree. Implementing instances of those frameworks would therefore be more efficient if linear and mixed-integer programming solvers let users customize such aspects eas...

Circuit-augmentation algorithms are generalizations of the simplex method, where in each step one is allowed to move along a fixed set directions, called circuits, that superset edges polytope. We show circuit-augmentation framework greatest-improvement and Dantzig pivot rules NP-hard, already for 0/1-LPs. Differently, steepest-descent rule can be carried out polynomial time 0/1 setting, number...

It was once taken for granted that learning in animals and man could be explained with a simple set of general learning rules, but over the last hundred years, a substantial amount of evidence has been accumulated that points in a quite different direction. In animal learning theory, the laws of learning are no longer considered general. Instead, it has been necessary to explain behaviour in te...

Node elimination is a numerical approach for obtaining cubature rules the approximation of multivariate integrals. Beginning with known rule, nodes are selected elimination, and new, more efficient rule constructed by iteratively solving moment equations. This paper introduces new criterion selecting which to eliminate that based on linearization equation. In addition, penalized iterative solve...