Search Results for ""
351 - 360 of 1585 for Optimization ProblemSearch Results
The Heesch number of a closed plane figure is the maximum number of times that figure can be completely surrounded by copies of itself. The determination of the maximum ...
A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...
Separation of variables is a method of solving ordinary and partial differential equations. For an ordinary differential equation (dy)/(dx)=g(x)f(y), (1) where f(y)is nonzero ...
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...
Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...
How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...
A bicentric quadrilateral, also called a cyclic-inscriptable quadrilateral, is a four-sided bicentric polygon. The inradius r, circumradius R, and offset x are connected by ...
Conway's soldiers, also known as the "solitaire army" game (Berlekamp et al. 1982) or "checker-jumping problem" (Honsberger 1976) is a one-player game played on an infinite ...
A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...
A pseudoperfect number, sometimes also called a semiperfect number (Benkoski 1972, Butske et al. 1999), is a positive integer such as 20=1+4+5+10 which is the sum of some (or ...
...
View search results from all Wolfram sites (161130 matches)

