We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
i As the pace of biological research accelerates, biologists are becoming increasingly reliant on computers to manage the information explosion. Biologists communicate their resea...
Lynette Hirschman, Alexander A. Morgan, Alexander ...
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
The abstract mathematical theory of partial differential equations (PDEs) is formulated in terms of manifolds,scalar fields, tensors, and the like, but these algebraic structures a...