Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
Abstract. Multiply sectioned Bayesian networks (MSBNs) were originally proposed as a modular representation of uncertain knowledge by sectioning a large Bayesian network (BN) into ...
General-purpose computing on graphics processing units (GPGPU) has recently gained considerable attention in various domains such as bioinformatics, databases and distributed comp...
Abdullah Gharaibeh, Samer Al-Kiswany, Matei Ripean...
ABSTRACT. Cost-effective reconfiguration in ODBMSs is difficult to achieve due to the tradeoff between modularity and efficiency. Existing ODBMS designs offer limited reconfigurabi...
In this paper, we present a collection of aspect-oriented refactorings covering both the extraction of aspects from objectoriented legacy code and the subsequent tidying up of the...