Search Results for ""

The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

Informally, self-similar objects with parameters N and s are described by a power law such as N=s^d, where d=(lnN)/(lns) is the "dimension" of the scaling law, known as the ...

A heterosquare is an n×n array of the integers from 1 to n^2 such that the rows, columns, and diagonals have different sums. (By contrast, in a magic square, they have the ...

A conjugate matrix is a matrix A^_ obtained from a given matrix A by taking the complex conjugate of each element of A (Courant and Hilbert 1989, p. 9), i.e., ...

An apodization function similar to the Bartlett function.

A tangent point of two similar curves.

The meeting point of lines that connect corresponding points from homothetic figures. In the above figure, O is the homothetic center of the homothetic figures ABCDE and ...

A set of values of similar meaning obtained in any manner.

The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...