The expectation maximization algorithm arises in many computational biology applications that involve probabilistic models. What is it good for, and how does it work?

Who needs qubits? Factoring algorithm run on a probabilistic computer It shares some features with quantum annealers, but it's easier to build and operate.

Parallel tempering is a generic Markov chain Monte Carlo sampling method which allows good mixing with multimodal target distributions, where conventional Metropolis-Hastings algorithms often fail.

Richard M. Karp, Rajeev Motwani, Noam Nisan, Probabilistic Analysis of Network Flow Algorithms, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 ...

Artificial Intelligence Guide to Algorithms in AI Algorithms define the rules, conditions, and methodology that an AI will use when processing and analyzing data.