Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
The Earth Mover's distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretati...
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
In many systems, sensors are used to acquire information from external environments such as temperature, pressure and locations. Due to continuous changes in these values, and lim...
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...