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...
In this contribution, models of wireless channels are derived from the maximum entropy principle, for several cases where only limited information about the propagation environmen...
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
The research community has witnessed a large interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition wh...
Ali Abbasi, Ahmad Khonsari, Mohammad Sadegh Talebi
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...