Search Results for ""

For a particular format in the IEEE 754-2008 framework, a subnormal number is a nonzero floating-point number with magnitude less than the magnitude of that formatÕs smallest ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

For a graph vertex x of a graph, let Gamma_x and Delta_x denote the subgraphs of Gamma-x induced by the graph vertices adjacent to and nonadjacent to x, respectively. The ...

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...

In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...

A piecewise linear, one-dimensional map on the interval [0,1] exhibiting chaotic dynamics and given by x_(n+1)=mu(1-2|x_n-1/2|). (1) The first few iterations of (1) give x_1 ...

A tetromino is a 4-polyomino. There are five free tetrominoes, seven one-sided tetrominoes, and 19 fixed tetrominoes. The free tetrominoes are known as the T-tetromino, ...