The Challenge: Predicting Algorithm Performance Choosing the right algorithm for a complex task can save significant time and computational resources. However, many state-of-the-art algorithms are ...

This project demonstrates how to measure and compare the runtime performance of different algorithms in C++, with results visualized in a web-based Quality of Results (QoR) viewer.

Abstract: This paper analyzes the stochastic runtime of the cross-entropy (CE) algorithm for the well-studied standard problems ONEMAX and LEADINGONES. We prove that the total number of solutions the ...

Abstract: Context-aware and smart systems that require runtime reconfiguration to cope with changes in the environment increasingly demand variability management mechanisms that can address runtime ...

Edit distance—a classical problem in computer science—has received ongoing attention from both practitioners and theoreticians. Given two strings A and B, the edit distance is the minimum number of ...