Chemical computing models have been proposed since the 1980ies for expressing concurrent computations in elegant ways for shared memory systems. In this paper we look at the distri...
Thomas Meyer, Lidia Yamamoto, Christian F. Tschudi...
We present a memetic algorithm that dynamically optimizes the design of a wireless sensor network towards energy conservation and extension of the life span of the network, taking ...
Konstantinos P. Ferentinos, Theodore A. Tsiligirid...
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly t...
We characterize probabilities in Bayesian networks in terms of algebraic expressions called quasi-probabilities. These are arrived at by casting Bayesian networks as noisy AND-OR-...