Search Results for ""

A correspondence between a permutation and a pair of Young tableaux.

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

Sinai billiards is the reflection of a ray of light by an arrangement of perfectly reflecting circles in the plane (Trott 2004, pp. 28-30). The path is extremely sensitive to ...

Stochastic optimization refers to the minimization (or maximization) of a function in the presence of randomness in the optimization process. The randomness may be present as ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

Take K a number field and L an Abelian extension, then form a prime divisor m that is divided by all ramified primes of the extension L/K. Now define a map phi_(L/K) from the ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

Using a Tschirnhausen transformation, the principal quintic form can be transformed to the one-parameter form w^5-10cw^3+45c^2w-c^2=0 (1) named after Francesco Brioschi ...