Search Results for ""
321 - 330 of 1536 for Small-World Network Average PathSearch Results
Find the plane lamina of least area A which is capable of covering any plane figure of unit generalized diameter. A unit circle is too small, but a hexagon circumscribed on ...
In mathematics, a small positive infinitesimal quantity, usually denoted epsilon or epsilon, whose limit is usually taken as epsilon->0. The late mathematician P. Erdős also ...
In a given acute triangle DeltaABC, find the inscribed triangle whose perimeter is as small as possible. The answer is the orthic triangle of DeltaABC. The problem was ...
A convex figure constructed by iteratively halving the base of an equilateral triangle and then sliding adjacent triangles so that they slightly overlap. Combining several ...
The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...
A curve which may pass through any region of three-dimensional space, as contrasted to a plane curve which must lie in a single plane. Von Staudt (1847) classified space ...
The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...
The elongated square gyrobicupola nonuniform polyhedron obtained by rotating the bottom third of a small rhombicuboctahedron (Ball and Coxeter 1987, p. 137). It is also ...
The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...
If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...
...
View search results from all Wolfram sites (167717 matches)

