TOPICS
Search

Search Results for ""


481 - 490 of 1392 for linear programmingSearch Results
Let S be a mathematical statement, then the Iverson bracket is defined by [S]={0 if S is false; 1 if S is true, (1) and corresponds to the so-called characteristic function. ...
Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...
A knot invariant is a function from the set of all knots to any other set such that the function does not change as the knot is changed (up to isotopy). In other words, a ...
A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...
For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...
Let E(k) and K(k) be complete elliptic integrals of the first and second kinds, with E^'(k) and K^'(k) the complementary integrals. Then ...
Linkages are linked (or constrained) mechanical structures such as those used in robots, excavators, engines, etc. They are also extensively used for character animation in ...
The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...
The map-Airy distribution is a statistical distribution having probability density function and distribution function P(x) = 2e^(-2x^3/3)[xAi(x^2)-Ai^'(x^2)] (1) D(x) = (2) ...
When a pair of non-incident edges of a tetrahedron is chosen, the midpoints of the remaining 4 edges are the vertices of a planar parallelogram. Furthermore, the area of this ...
1 ... 46|47|48|49|50|51|52 ... 140 Previous Next

...