The minimax algorithm is a specialized search algorithm which returns the optimal sequence of moves for a player in an zero-sum game. On its own, it is too complex to be practical for a game-playing program, but there are several extensions that, ta
Election algorithms arewidely used in the primary-backup replication, and ithas been proved to be harder than the con- sensus problem. In this paper, the relation between the election problem and the consensus problem is analysed, and a new fault- t
ssGA is a simple and easy to use implementation of a Steady State Generic Algorithm. This algorithm generates a new individual in every step. The new individual is inserted in the population with his parents, and he always replaces to the worst indi
The Algorithms such as SVD, Eigen decomposition, Gaussian Mixture Model, HMM etc. are scattered in different fields. There is the need to collect all such algorithms for quick reference. Also there is the need to view such algorithms in application
We describe the maximum-likelihood parameter estimation problem and how the Expectation- Maximization (EM) algorithm can be used for its solution. We first describe the abstract form of the EM algorithm as it is often given in the literature. We the
