In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Abstract. We extend the automata-theoretic framework for reasoning about infinitestate sequential systems to handle also the global model-checking problem. Our framework is based o...
— In this paper we evaluate, by means of Extrinsic Information Transfer (EXIT) charts, an iterative receiver that has emerged as a promising candidate for non-coherent multi-user...
Peter Hammarberg, Fredrik Rusek, Pierluigi Salvo R...
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...