Sommer Term 2017

In our colloquium at the Department of Computer Science, national and international guests as well as department members present their research. Our guest speakers present impacting topics across various areas of the discipline. The colloquium series is held every semester and also includes inaugural and farewell lectures of the department's professors.

The colloquium is a noteworthy event for all graduate students as the talks are seen as a key part of their education at HSZG. The talks are also open to the public and outside attendance is welcome.

For news about the colloquium, the undefinedEAD-Lunch talks and seminars please feel free to subscribe to (Register here:!forum/ead-public)


28.07.2017 Prof. Thomas Weise "Automating Scientific Work in Optimization"


In the fields of heuristic optimization and machine learning, experimentation is the way to assess the performance of an algorithm setup and the hardness of problems. Good experimentation is complicated. Most algorithms in the domain are anytime algorithms, meaning they can improve their approximation quality over time. This means that one algorithm may initially perform better than another one but converge to worse solutions in the end. Instead of single final results, the whole runtime behavior of algorithms needs to be compared (and runtime may be measured in multiple ways). We do not just want to know which algorithm performs best and which problem is the hardest ― a researcher wants to know why. We introduce a process which can 1) automatically model the progress of algorithm setups on different problem instances based on data collected in experiments, 2) use these models to discover clusters of algorithm (or problem instance) behaviors, and 3) propose reasons why a certain algorithm setup (or problem instance) belongs to a certain algorithm (or problem instance) behavior cluster. These high-level conclusions are presented in form of decision trees relating algorithm parameters (or instance features) to cluster ids. We emphasize the duality of analyzing algorithm setups and problem instances. Our process is implemented as open source software and tested in two case studies, on the Maximum Satisfiability Problem and the Traveling Salesman Problem. Besides its basic application to raw experimental data, yielding clusters and explanations of “quantitative” algorithm behavior, our process also allows for “qualitative” conclusions by feeding it with data which is normalized with problem features or algorithm parameters. It can also be applied recursively, e.g., to further investigate the behavior of the algorithms in the cluster with the best-performing setups on the problem instances belonging to the cluster of hardest instances. Both use cases are investigated in the case studies.


17.05.2017 Philipp Herzig "Bi-Modal IT as an architectural style for transforming large business systems into the Cloud"


SAP is known for being the largest vendor for ERP systems. Typically, these systems are installed on premise, i.e., inside the customer’s own IT. However, customers continuously increase investments into the Cloud as well. This results in hybrid, inherently distributed infrastructures which must be carefully designed in terms of technical requirements and trade-offs (e.g., CAP Theorem). This talk gives a brief introduction into the history of SAP and touches on concepts such as the Innovator’s Dilemma as well as Bi-Modal IT as a potential solution approach. In addition, we provide some insight into our software engineering methods and tools which are used for building our cloud-based software today.

Letzte Änderung:11. September 2017

Direktlinks & Suche