(computing theory) An algorithm for transforming a given set of generators for a polynomial ideal into a Gröbner basis with respect to some monomial order.

(computing theory) An iterative heuristic algorithm for bipartitioning a hypergraph.

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

plural of algorist

One who uses arabic numerals to represent numbers and to perform calculations, as opposed to one who uses Roman numerals to represent numbers and an abacus to perform calculations.

The process of algorithmicizing.

(computer graphics) An algorithm that identifies which points (pixels) should be set in order to draw a straight line between two points.

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

Rule by algorithms, where political decisions are being made by algorithms, and thus making representative democracy obsolete.

(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.