TOPICS
Search

Search Results for ""


421 - 430 of 1392 for linear programmingSearch Results
A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.
A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...
The Fibonacci chain map is defined as x_(n+1) = -1/(x_n+epsilon+alphasgn[frac(n(phi-1))-(phi-1)]) (1) phi_(n+1) = frac(phi_n+phi-1), (2) where frac(x) is the fractional part, ...
A Jensen disk is a disk in the complex plane whose diameter joins complex conjugate roots of a polynomial (Trott 2004, p. 22).
The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...
The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).
The number of digits used to perform a given computation. The concepts of accuracy and precision are both closely related and often confused. While the accuracy of a number x ...
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 ...
1 ... 40|41|42|43|44|45|46 ... 140 Previous Next

...