Dynamic programming is an approach that transforms a multi variable optimization problem into a sequence of single variable optimization problems. Discrete dynamic programming requires us to define… Expand

Explicit mappings from the first 22p integers into the ordered vertices of the pth Hilbert polygon and vice versa are derived. Generalisations of this result are discussed. Algorithms to achieve the… Expand

Triplex is a language which supports interval arithmetic. The interval is represented by a triple. That is, the end points of the interval plus the value that real computer arithmetic would… Expand

Explicit mappings from the first n2p base n Gray code integers into the ordered vertices of the pth Peano polygon and vice versa are derived. The result is generalised to r-dimensional Peano… Expand