When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for ch...
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...