Search Results for ""
561 - 570 of 13135 for Discrete Probability DistributionSearch Results
Operations research is a vast branch of mathematics which encompasses many diverse areas of minimization and optimization. Thousands of books have been written worldwide on ...
If A moves along a known curve, then P describes a pursuit curve if P is always directed toward A and A and P move with uniform velocities. Pursuit curves were considered in ...
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, ...
The stella octangula is a polyhedron compound composed of a tetrahedron and its dual (a second tetrahedron rotated 180 degrees with respect to the first). The stella ...
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. ...
Buffon's needle problem asks to find the probability that a needle of length l will land on a line, given a floor with equally spaced parallel lines a distance d apart. The ...
A die (plural "dice") is a solid with markings on each of its faces. The faces are usually all the same shape, making Platonic solids and Archimedean duals the obvious ...
The constant pi, denoted pi, is a real number defined as the ratio of a circle's circumference C to its diameter d=2r, pi = C/d (1) = C/(2r) (2) pi has decimal expansion ...
The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...
...
View search results from all Wolfram sites (27022 matches)

