A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
Marc Benkert, Herman J. Haverkort, Moritz Kroll, M...
In this paper we propose a genetic and greedy algorithm combination for the optimization of the Topological Active Nets (TAN) model. This is a deformable model used for image segme...
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Wire Pipelining (WP) has been proposed in order to limit the impact of increasing wire delays. In general, the added pipeline elements alters the system such that architectural ch...