(statistics) An algorithm for pseudorandom number sampling, relying on an underlying source of uniformly-distributed random numbers as well as computed tables.

plural of ziggurat algorithm

(computing theory) An algorithm for finding the contiguous subarray within a one-dimensional numeric array which has the largest sum.

(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.

plural of randomized algorithm

plural of Rete algorithm

plural of memetic algorithm

plural of Karatsuba algorithm

(statistical mechanics) A criterion for choosing a probability distribution for the statistical ensemble of microstates of a thermodynamic system by minimizing the average log probability ⟨ ln p_i⟩=∑ᵢp_i ln p_i,, subject to the probability distribution pᵢ satisfying a set of constraints (usually expectation values) corresponding to the known macroscopic quantities.

A method for minimization of Boolean functions, functionally identical to Karnaugh mapping, but having a tabular form that is more efficient in computer algorithms. It is based on finding prime implicants.