(computing theory) A heuristic algorithm for finding partitions of graphs, having important applications in the layout of digital circuits and components in VLSI.

(statistics) A Markov chain Monte Carlo method for obtaining a sequence of random samples from a probability distribution from which direct sampling is difficult.

(computing theory) A certain unsupervised learning algorithm for neural networks, having separate "wake" and "sleep" phases that attempt to connect the layers of neurons in alternating directions.

(logic) An algorithm for checking the validity of a first-order logic formula using a resolution-based decision procedure for propositional logic.

(computer science) An algorithm for matrix multiplication.

An inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions. It uses dynamic programming to compute the values in two passes, the first going forward in time and the second backward.

(numerical analysis) An algorithm that significantly reduces the numerical error in the total obtained by adding a sequence of finite-precision floating-point numbers, compared to the obvious approach, by tracking the accumulated small errors in a separate variable.

An algorithm for finding a solution to the stable marriage problem in polynomial time.

Synonym of computational number theory.

(computing theory) An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points.