Fourier-Motzkin variable elimination is introduced as a complete method for deciding linear arithmetic inequalities over R. It is then shown how this method can be extended to also work over Z, giving the Omega Test [2].

A simple but powerful modification of the standard Gaussian distribution is studied. The variables of the rectified Gaussian are constrained to be nonnegative, enabling the use of nonconvex energy functions. Two multimodal examples, the competitive and cooperative distributions, illustrate the representational power of the rectified Gaussian. Since the cooperative distribution can represent the...

In this article we extend and generalize the ideas of two previous articles devoted to linear sensor networks to nonlinear systems. In those previous articles the use of cutsets and a decomposition procedure were proposed and proved efficient to solve large scale linear problems. In this article we show that a similar procedure, now based on a variable elimination scheme, can be also used effic...

We present new complexity results on the class of All constraints The central idea involves func tional elimination a general method of elimination whose focus is on the subclass of functional constraints One result is that for the subclass of All constraints strong n consistency and minimality is achievable in O en time where e n are the number of constraints and variables The main result is t...

In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time’s spending. Further, both of them can be used efficiently not only for positive (semi-) definite, but for any non-singular symmetric matrix inversion. We use simulation to verify results, ...