Search Results for ""
11 - 20 of 35 for Carnot EfficiencySearch Results
In statistics, sampling is the selection and implementation of statistical observations in order to estimate properties of an underlying population. Sampling is a vital part ...
Let X_1, ..., X_N be a sequence of independent observations of a random variable X, and let the number of observations N itself be chosen at random. Then Wald's equation ...
The circumradius of a cyclic polygon is a radius of the circle inside which the polygon can be inscribed. Similarly, the circumradius of a polyhedron is the radius of a ...
The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...
The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...
Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...
The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...
Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...
Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...
Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...
...
View search results from all Wolfram sites (2172 matches)

