This paper presents a novel approach for partitioning a class of loop nests whose iterations perform a varying amount of work due to the presence of IF statements. This approach is based on a pre-partitioning loop transformation, index set splitting, which removes the conditional. Preliminary experimental results on a virtual shared memory parallel computer demonstrate the performance improveme...

Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turned out to be useful for finding and counting (minimum) dominating sets (van Rooij et al., ESA 2009). In this paper, we extend the technique to the setting where one is given a set of properties and seeks (or wants to count) solu...

An FPT algorithm with a running time of O(n+2n) is described for the Set Splitting problem, parameterized by the number k of sets to be split. It is also shown that there can be no FPT algorithm for this problem with a running time of the form 2n unless the satisfiability of n-variable 3SAT instances can be decided in time 2.

Splitting a variable in a Boolean formula means to replace an arbitrary set of its occurrences by a new variable. In the minimum splitting SAT problem, we ask for a minimum-size set of variables to be split in order to make the formula satisfiable. This problem is known to be APX-hard, even for 2-CNF formulas. We consider the case of 2CNF Horn formulas, i. e., 2-CNF formulas without positive 2-...

In this paper, an unmanned aerial vehicle (UAV) assisted cooperative communication system is studied, wherein a source transmits information to the destination through an energy harvesting decode-and-forward UAV. It is assumed that the UAV can freely move in between the source-destination pair to set up line of sight communications with the both nodes. Since the battery of the UAV may be limite...