In this paper, a new gene based adaptive mutation scheme is proposed for genetic algorithms (GAs), where the information on gene based fitness statistics and on gene based allele...
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
In this work, we develop a secret sharing based compiler solution to achieve confidentiality, integrity and availability (intrusion tolerance) of critical data together, rather th...
Aggressive software speculation holds significant potential, because it enables program transformations to reduce the program’s critical path. Like any form of speculation, how...
After developing a model free table recognition system we wanted to tune parameters in order to optimize the recognition performance. Therefore we developed a benchmarking environ...