Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
Awareness of the need for robustness in distributed systems increases as distributed systems become an integral part of day-to-day systems. Tolerating Byzantine faults and possessi...
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
This paper presents an updated version of the adaptive learning particle swarm optimizer (ALPSO) [6], we call it ALPSO-II. In order to improve the performance of ALPSO on multi-mod...
Abstract–A new evolutionary programming algorithm (NEP) using the non-uniform mutation operator instead of Gaussian or Cauchy mutation operators is proposed. NEP has the merits o...