Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
Jochen Eisinger, Ilia Polian, Bernd Becker, Alexan...
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevi...
In this paper, we introduce an adaptive evolutionary approach to solve the short-term electrical generation scheduling problem (STEGS). The STEGS is a hard constraint satisfaction...
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...