<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<div class="moz-text-html" lang="x-unicode"> A T T E N T I O N:<br>
Please not the time being different than usual.<br>
<br>
<br>
<br>
I N V I T A T I O N<br>
<font face="sans-serif"> </font><br>
<font face="sans-serif">===============================================<br>
<br>
to the Research Seminar 'Computer Graphics, Image Processing,
and Visualization'<br>
<br>
</font><font face="sans-serif"> on<font face="sans-serif">
Tuesday, February 7th, 2016, at 12:00 PM (noon),<br>
in Room P-701 in the Paulinum, Augustusplatz.</font><br>
</font><br>
<font face="sans-serif">===============================================</font><br>
<br>
A talk is given by<br>
<br>
Sebastian Volke<br>
Department of Computer Science<br>
Leipzig University.<br>
<br>
and is entitled<br>
<br>
"Coarse-Graining Large Search Landscapes using Massive
Edge Collapse".<br>
<br>
Abstract:<br>
<br>
<font face="sans-serif"> A thorough understanding of discrete
optimization problem instances is the<br>
foundation for the development of successful solving
strategies. Thereby,<br>
the analysis of search landscapes is a valuable tool.
However, because of<br>
the large number of solutions topological analysis methods
for search<br>
landscapes are typically restricted to very small problem
instances which<br>
are much smaller than instances that occur in practical
applications. In<br>
this paper, we present a coarse-grained abstraction of
search<br>
landscapes---the meta landscape---that is accessible for a
complete<br>
analysis, can be computed easily and preserves relevant
properties of the<br>
original search landscapes. We show, how a barrier tree can
be computed for<br>
meta landscapes and be used for a visual depiction of the
search<br>
landscapes. Thus, detailed topological analysis and
visualization become<br>
available for problem instances of realistic sizes. We
demonstrate the use<br>
of our method for search spaces of up to more than 10^50
solutions.<font face="sans-serif"><br>
<br>
</font><font face="sans-serif"><font face="sans-serif">===============================================<br>
</font></font><br>
On behalf of Professor Scheuermann all those interested are
cordially invited to attend.<br>
<br>
Yours sincerely,</font><br>
Tom Liebmann </div>
</body>
</html>