Rank-three matroids are Rayleigh.
Realization of Boolean functions by repetition-free formulas in a particular base.
Reconstructibility of Boolean control networks with time delays in states
This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current...
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions
Reduction in the number of LUT elements for control units with code sharing
Two methods are proposed targeted at reduction in the number of look-up table elements in logic circuits of compositional microprogram control units (CMCUs) with code sharing. The methods assume the application of field-programmable gate arrays for the implementation of the combinational part of the CMCU, whereas embedded-memory blocks are used for implementation of its control memory. Both methods are based on the existence of classes of pseudoequivalent operational linear chains in a microprogram...
Remarks about energy transfer in an RC ladder network
The problem of energy transfer in an -ladder network is considered. Using the maximum principle, an algorithm for constructing optimal control is proposed, where the cost function is the energy delivered to the network. In the case considered, optimal control exists. Numerical simulations were performed using Matlab.
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
Résolution d'un programme quadratique en variantes bivalentes par décomposition application au placement de commutateurs dans un réseau
Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, more precisely the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching programs are defined and a lower bound method is presented. Furthermore, the first exponential...