Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hartmut Pohlheim
dblp:08/5017
· DBLP profile ↗
7ranked-venue papers
2as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-authorSecurity and privacy · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Software testing · 77% Program analysis · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Software testing › test generation › search-based test generation
evolutionary testing |
0.0 | 1 | 1999 | Testing the Temporal Behavior of Real-Time Tasks Using Extended Evolutionary Algorithms · RTSS 1999 |
Program analysis
static analysis |
0.0 | 1 | 1999 | Testing the Temporal Behavior of Real-Time Tasks Using Extended Evolutionary Algorithms · RTSS 1999 |
Methods — techniques the papers use, named apart from their topics
evolutionary algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Reviewing Software Models in Compliance with ISO 26262
Ingo Stürmer, Elke Salecker, Hartmut Pohlheim |
SAFECOMP | 3 |
| 2006 | Multidimensional Scaling for Evolutionary Algorithms - Visualization of the Path through Search Space and Solution Space Using Sammon MappingabstractMultidimensional scaling as a technique for the presentation of high-dimensional data with standard visualization techniques is presented. The technique used is often known as Sammon mapping. We explain the mathematical foundations of multidimensional scaling and its robust calculation. We also demonstrate the use of this technique in the area of evolutionary algorithms. First, we present the visualization of the path through the search space of the best individuals during an optimization run. We then apply multidimensional scaling to the comparison of multiple runs regarding the variables of individuals and multi-criteria objective values (path through the solution space). Hartmut Pohlheim |
Artif. Life | 1 |
| 2006 | Understanding the Course and State of Evolutionary Optimizations Using Visualization: Ten Years of Industry Experience with Evolutionary AlgorithmsabstractEvolutionary algorithms (EAs) are widely employed to solve a broad range of optimization problems. Even though they work in an algorithmically simple manner, it is not always easy to understand what is going on during a particular optimization run. It is especially desirable to gain further insight into the state and course of the algorithm if the optimization does not yield the expected results or if we are not sure whether the result achieved is really the best result possible. During an optimization run an EA produces a vast amount of data. The extraction of useful information is a nontrivial task. In this article, we review visualization methods used to extract this useful information. We also demonstrate the application of visualization techniques and explain how they help us to understand the course and state of the EA. This extra information gained by the use of visualization techniques is often the difference between a good result and a very good result. In complex real-world applications, merely achieving a good result often means that the approach has failed. On the other hand, a success means large gains in productivity or safety or a decrease in costs. Hartmut Pohlheim |
Artif. Life | 1 |
| 2005 | Complementary selection and variation for an efficient multiobjective optimization of complex systemsabstractReal-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more details, new methods and, finally, more complexity. By confronting a benchmark evolutionary algorithm with an automotive gearbox with hundreds of parameters to optimize, we were able to observe new requirements which led us to an additional procedure that uses specific knowledge upon gene-objective relations to guide cross-over mechanisms Benoît Bagot, Hartmut Pohlheim |
Congress on Evolutionary Computation | 2 |
| 2003 | Structural and Functional Sequence Test of Dynamic and State-Based Software with Evolutionary Algorithms
André Baresel, Hartmut Pohlheim, Sadegh Sadeghipour |
GECCO | 2 |
| 2002 | Automatic Test Data Generation For Structural Testing Of Embedded Software Systems By Evolutionary Testing
Joachim Wegener, Kerstin Buhr, Hartmut Pohlheim |
GECCO | 3 |
| 1999 | Testing the Temporal Behavior of Real-Time Tasks Using Extended Evolutionary AlgorithmsabstractFor real-time systems, correct system functionality depends on logical as well as on temporal correctness. Static analysis alone is not sufficient to verify the temporal behavior of real-time systems. Since existing test methods are not specialized for the verification of temporal correctness, we have developed a new testing method, namely evolutionary testing. This paper illustrates results of the first industrial application of the evolutionary test. Joachim Wegener, Harmen Sthamer, Hartmut Pohlheim |
RTSS | 3 |