Search Results for ""

Instead of picking two points from the interior of the cube, instead pick two points on different faces of the unit cube. In this case, the average distance between the ...

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...

Using disk point picking, x = sqrt(r)costheta (1) y = sqrt(r)sintheta (2) for r in [0,1], theta in [0,2pi), choose two points at random in a unit disk and find the ...

The W polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. (The corresponding w polynomials are called Lucas polynomials.) They have explicit ...

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

The values of -d for which imaginary quadratic fields Q(sqrt(-d)) are uniquely factorable into factors of the form a+bsqrt(-d). Here, a and b are half-integers, except for ...

The hyperbolic secant is defined as sechz = 1/(coshz) (1) = 2/(e^z+e^(-z)), (2) where coshz is the hyperbolic cosine. It is implemented in the Wolfram Language as Sech[z]. On ...

A general integral transform is defined by g(alpha)=int_a^bf(t)K(alpha,t)dt, where K(alpha,t) is called the integral kernel of the transform.

C. Kimberling has extensively tabulated and enumerated the properties of triangle centers (Kimberling 1994, 1998, and online), denoting the nth center in his numbering scheme ...