TOPICS
Search

Search Results for ""


191 - 200 of 1015 for Computational AlgorithmsSearch Results
An orientable surface with one boundary component such that the boundary component of the surface is a given knot K. In 1934, Seifert proved that such a surface can be ...
n weighings are sufficient to find a bad coin among (3^n-1)/2 coins (Steinhaus 1999, p. 61). vos Savant (1993) gives an algorithm for finding a bad ball among 12 balls in ...
The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...
Keller conjectured that tiling an n-dimensional space with n-dimensional hypercubes of equal size yields an arrangement in which at least two hypercubes have an entire ...
Let A denote an R-algebra, so that A is a vector space over R and A×A->A (1) (x,y)|->x·y. (2) Now define Z={x in A:x·y=0 for some y in A!=0}, (3) where 0 in Z. An Associative ...
The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...
The Jacobi symbol, written (n/m) or (n/m) is defined for positive odd m as (n/m)=(n/(p_1))^(a_1)(n/(p_2))^(a_2)...(n/(p_k))^(a_k), (1) where m=p_1^(a_1)p_2^(a_2)...p_k^(a_k) ...
A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...
A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...
The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...
1 ... 17|18|19|20|21|22|23 ... 102 Previous Next

...