plural of memetic algorithm

(computer graphics) A simple rendering technique that sorts all the polygons in a scene by their depth and then paints them in that order, from farthest to closest.

(computing theory) An iterative algorithm that is an adaptation of power methods to find the most useful eigenvalues and eigenvectors of an nth-order linear system with a limited number of operations, m, where m is much smaller than n.

A pattern-matching algorithm for implementing production rule systems, used to determine which of the system's rules should fire based on its data store.

(mathematics) An iterative algorithm used to find simple approximations to functions, specifically, approximations by functions in a Chebyshev space that are the best in the uniform norm L_∞ sense.

(computing theory) A fast multiplication algorithm that reduces the multiplication of two n-digit numbers to at most n^(log ₂₃)≈n^(1.585) single-digit multiplications.

(mathematics) Any algorithm that uses randomness as part of its logic.

(computing) A method of finding a nearly optimal solution to an optimization problem that cannot be solved exactly within a reasonable time.

Synonym of computational number theory.

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