We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...