We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is pai...
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
The limitations of linear chromosomes and conventional recombination operators are reviewed. It is argued that there are at least three classes of problems for which such represen...
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. ...
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...