In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Abstract. In systems based on organisational specifications a reoccurring problem remains to be solved in the disparity between the level actness of the organisational concepts an...
—We have integrated processing with deterministic and non-deterministic resource usage in an overall application and evaluated its performance on a multi-core processor platform....