computational algorithm
101Dijkstra-Scholten algorithm — The Dijkstra Scholten algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.First, let us consider the case of a simple process graph which is a tree. A… …
102Cornacchia's algorithm — In computational number theory, Cornacchia s algorithm is an algorithm for solving the Diophantine equation x2 + dy2 = m, where and d and m are coprime. The algorithm was described in 1908 by Giuseppe Cornacchia[1]. Contents 1 The algorithm …
103Common Scrambling Algorithm — The Common Scrambling Algorithm (or CSA) is the encryption algorithm used in the DVB digital television broadcasting for encrypting video streams. CSA was specified by ETSI and adopted by the DVB consortium in May 1994. Contents 1 History 2… …
104Todd–Coxeter algorithm — In group theory, the Todd–Coxeter algorithm, discovered by J.A. Todd and H.S.M. Coxeter in 1936, is an algorithm for solving the coset enumeration problem. Given a presentation of a group G by generators and relations and a subgroup H of G , the… …
105Berlekamp's algorithm — In mathematics, particularly computational algebra, Berlekamp s algorithm is a well known method for factoring polynomials over finite fields (also known as Galois fields ). The algorithm consists mainly of matrix reduction and polynomial GCD… …
106Genetic algorithm in economics — Genetic algorithms are used to model the learning behaviour of economic agents. The term genetic algorithm is often abbreviated as GA. The genetic algorithm is a particular class of evolutionary algorithm inspired by evolutionary biology. A… …
107Gift wrapping algorithm — The gift wrapping algorithm is a simple algorithm for computing the convex hull of a given set of points. Planar case In the two dimensional case the algorithm is also known as Jarvis march, after R. A. Jarvis, who published it in 1973; it has O( …
108Gale-Church alignment algorithm — In computational linguistics, the Gale Church algorithm is a method for aligning corresponding sentences in a parallel corpus. It works on the principle that equivalent sentences should roughly correspond in length mdash;that is, longer sentences …
109Lenstra–Lenstra–Lovász lattice basis reduction algorithm — The Lenstra–Lenstra–Lovász lattice basis reduction (LLL) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász. Given as input d lattice basis vectors with n dimensional integer coordinates… …
110Cultural algorithm — Cultural algorithms (CA) are a branch of evolutionary computation where there is a knowledge component that is called the belief space in addition to the population component. In this sense, cultural algorithms can be seen as an extension to a… …
