We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
The investigation of evolutionary algorithms as adaptation schemes has a long history starting with Holland (1975). The Ising model from physics leads to a variety of different pr...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
Background: Gene-set analysis evaluates the expression of biological pathways, or a priori defined gene sets, rather than that of individual genes, in association with a binary ph...
Irina Dinu, John D. Potter, Thomas Mueller, Qi Liu...