Search Results for ""

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

For a sequence {chi_i}, the Levine-O'Sullivan greedy algorithm is given by chi_1 = 1 (1) chi_i = max_(1<=j<=i-1)(j+1)(i-chi_j) (2) for i>1. The sequence generated by this ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

An algorithm for finding roots for quartic equations with complex roots.