Search Results for ""
451 - 460 of 1636 for Bin Packing ProblemSearch Results
Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...
Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...
Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...
A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...
The outer Soddy circle is the solution to the four coins problem. It has circle function l=((-a+b+c)^2[f(a,b,c)+16g(a,b,c)rs])/(4bc[(a^2+b^2+c^2)-2(ab+bc+ca)+8rs]^4), (1) ...
Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...
The polyhedron resulting from letting each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces.
Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...
A parallelogram (parallelepiped) containing the minimum repeatable elements of a circle (sphere) packing.
Given three noncollinear points, construct three tangent circles such that one is centered at each point and the circles are pairwise tangent to one another. Then there exist ...
...
View search results from all Wolfram sites (160700 matches)

