In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
Sam Verboven, Peter Hellinckx, Frans Arickx, Jan B...
A new multi-purpose LightWeight Grid system (LWG) is introduced, under the acronym CoBRA grid (Computational Basic Reprogrammable Adaptive grid). It provides the functionality gri...
Peter Hellinckx, Gunther Stuer, Wouter Hendrickx, ...
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are of interest in quantum computing, optical computing...
D. Michael Miller, Dmitri Maslov, Gerhard W. Dueck