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.

(computer science, graph theory) An algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles).

(computing theory) An algorithm for approximating the number of distinct elements in a stream with a single pass and logarithmic space consumption.

(computing) A search procedure which involves generating and checking all possible scenarios.

(computing theory) A method for parsing mathematical expressions specified in infix notation.

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

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

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