Search Results for ""

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

A set of five.

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

The maximum and minimum of the normal curvature kappa_1 and kappa_2 at a given point on a surface are called the principal curvatures. The principal curvatures measure the ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

Let the absolute frequencies of occurrence of an event in a number of class intervals be denoted f_1, f_2, .... The cumulative frequency corresponding to the upper boundary ...