plural of memetic algorithm

plural of hash algorithm

(mathematics) The simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.

(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.

(computing theory) A quantum algorithm that finds with high probability the unique input to a black-box function that produces a particular output value.

hash function

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

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

(graph theory, computing) An algorithm that computes single-source shortest paths in a weighted digraph, capable (unlike the faster Dijkstra's algorithm) of handling graphs with negative edge weights.

(mathematics) A general-purpose integer factorization algorithm, particularly effective at splitting composite numbers with small factors.