@inproceedings{46364,
  abstract     = {{Automated algorithm configuration procedures play an increasingly important role in the development and application of algorithms for a wide range of computationally challenging problems. Until very recently, these configuration procedures were limited to optimising a single performance objective, such as the running time or solution quality achieved by the algorithm being configured. However, in many applications there is more than one performance objective of interest. This gives rise to the multi-objective automatic algorithm configuration problem, which involves finding a Pareto set of configurations of a given target algorithm that characterises trade-offs between multiple performance objectives. In this work, we introduce MO-ParamILS, a multi-objective extension of the state-of-the-art single-objective algorithm configuration framework ParamILS, and demonstrate that it produces good results on several challenging bi-objective algorithm configuration scenarios compared to a base-line obtained from using a state-of-the-art single-objective algorithm configurator.}},
  author       = {{Blot, A and Hoos, H and Jourdan, L and Marmion, M and Trautmann, Heike}},
  booktitle    = {{LION 2016: Learning and Intelligent Optimization}},
  editor       = {{et al. Joaquin, Vanschooren}},
  pages        = {{32–47}},
  publisher    = {{Springer International Publishing}},
  title        = {{{MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework}}},
  doi          = {{10.1007/978-3-319-50349-3_3}},
  volume       = {{10079}},
  year         = {{2016}},
}

@inbook{46363,
  abstract     = {{The averaged Hausdorff distance has been proposed as an indicator for assessing the quality of finitely sized approximations of the Pareto front of a multiobjective problem. Since many set-based, iterative optimization algorithms store their currently best approximation in an internal archive these approximations are also termed archives. In case of two objectives and continuous variables it is known that the best approximations in terms of averaged Hausdorff distance are subsets of the Pareto front if it is concave. If it is linear or circularly concave the points of the best approximation are equally spaced.

Here, it is proven that the optimal averaged Hausdorff approximation and the Pareto front have an empty intersection if the Pareto front is circularly convex. But the points of the best approximation are equally spaced and they rapidly approach the Pareto front for increasing size of the approximation.}},
  author       = {{Rudolph, G and Schütze, O and Trautmann, Heike}},
  booktitle    = {{Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II}},
  editor       = {{Squillero, G and Burelli, P}},
  isbn         = {{978-3-319-31153-1}},
  pages        = {{42–55}},
  publisher    = {{Springer International Publishing}},
  title        = {{{On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front}}},
  doi          = {{10.1007/978-3-319-31153-1_4}},
  year         = {{2016}},
}

@inproceedings{46369,
  abstract     = {{This paper formally defines multimodality in multiobjective optimization (MO). We introduce a test-bed in which multimodal MO problems with known properties can be constructed as well as numerical characteristics of the resulting landscape. Gradient- and local search based strategies are compared on exemplary problems together with specific performance indicators in the multimodal MO setting. By this means the foundation for Exploratory Landscape Analysis in MO is provided.}},
  author       = {{Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}},
  booktitle    = {{Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)}},
  pages        = {{962–972}},
  publisher    = {{Springer}},
  title        = {{{Towards Analyzing Multimodality of Multiobjective Landscapes}}},
  doi          = {{10.1007/978-3-319-45823-6_90}},
  year         = {{2016}},
}

@inproceedings{46367,
  abstract     = {{When selecting the best suited algorithm for an unknown optimization problem, it is useful to possess some a priori knowledge of the problem at hand. In the context of single-objective, continuous optimization problems such knowledge can be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically identifies properties of a landscape, e.g., the so-called funnel structures, based on an initial sample. In this paper, we extract the relevant features (for detecting funnels) out of a large set of landscape features when only given a small initial sample consisting of 50 x D observations, where D is the number of decision space dimensions. This is already in the range of the start population sizes of many evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used for training the classifier, and the approach is then very successfully validated on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching competition problems.}},
  author       = {{Kerschke, Pascal and Preuss, Mike and Wessing, Simon and Trautmann, Heike}},
  booktitle    = {{Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation}},
  isbn         = {{978-1-4503-4206-3}},
  pages        = {{229–236}},
  title        = {{{Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models}}},
  doi          = {{10.1145/2908812.2908845}},
  year         = {{2016}},
}

@article{46371,
  abstract     = {{One main task in evolutionary multiobjective optimization (EMO) is to obtain a suitable finite size approximation of the Pareto front which is the image of the solution set, termed the Pareto set, of a given multiobjective optimization problem. In the technical literature, the characteristic of the desired approximation is commonly expressed by closeness to the Pareto front and a sufficient spread of the solutions obtained. In this paper, we first make an effort to show by theoretical and empirical findings that the recently proposed Averaged Hausdorff (or Δ𝑝-) indicator indeed aims at fulfilling both performance criteria for bi-objective optimization problems. In the second part of this paper, standard EMO algorithms combined with a specialized archiver and a postprocessing step based on the Δ𝑝 indicator are introduced which sufficiently approximate the Δ𝑝-optimal archives and generate solutions evenly spread along the Pareto front.}},
  author       = {{Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina, C and Trautmann, Heike}},
  journal      = {{Computational Optimization and Applications (Comput. Optim. Appl.)}},
  number       = {{2}},
  pages        = {{589–618}},
  title        = {{{Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results}}},
  doi          = {{10.1007/s10589-015-9815-8}},
  volume       = {{64}},
  year         = {{2016}},
}

@article{46372,
  abstract     = {{We present a new hybrid evolutionary algorithm for the effective hypervolume approximation of the Pareto front of a given differentiable multi-objective optimization problem. Starting point for the local search (LS) mechanism is a new division of the decision space as we will argue that in each of these regions a different LS strategy seems to be most promising. For the LS in two out of the three regions we will utilize and adapt the Directed Search method which is capable of steering the search into any direction given in objective space and which is thus well suited for the problem at hand. We further on integrate the resulting LS mechanism into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations. Finally, we will present some numerical results on several benchmark problems with two and three objectives indicating the strength and competitiveness of the novel hybrid.}},
  author       = {{Schütze, O and Sosa, Hernandez VA and Trautmann, Heike and Rudolph, G}},
  journal      = {{Journal of Heuristics}},
  number       = {{3}},
  pages        = {{273–300}},
  title        = {{{The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems}}},
  doi          = {{10.1007/s10732-016-9310-0}},
  volume       = {{22}},
  year         = {{2016}},
}

@inproceedings{46368,
  abstract     = {{Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented.}},
  author       = {{Kerschke, Pascal and Trautmann, Heike}},
  booktitle    = {{Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}},
  title        = {{{The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}}},
  doi          = {{10.1109/CEC.2016.7748359}},
  year         = {{2016}},
}

@article{46370,
  abstract     = {{This report documents the talks and discussions at the Dagstuhl Seminar 15211 "Theory of Evolutionary Algorithms". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution.}},
  author       = {{Neumann, F and Trautmann, Heike}},
  journal      = {{Dagstuhl Reports}},
  number       = {{5}},
  pages        = {{78–79}},
  title        = {{{Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}}},
  doi          = {{10.4230/DagRep.5.5.57}},
  volume       = {{5}},
  year         = {{2016}},
}

@inproceedings{48309,
  author       = {{Habernal, Ivan and Gurevych, Iryna}},
  booktitle    = {{Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}}},
  doi          = {{10.18653/v1/d16-1129}},
  year         = {{2016}},
}

@inbook{48339,
  author       = {{Wille, Manuel}},
  booktitle    = {{Kanzlei und Sprachkultur. Beiträge der 8. Tagung des Arbeitskreises Historische Kanzleisprachenforschung, Dresden 3. bis 5. September 2015}},
  editor       = {{Hünecke, Rainer and Aehnelt, Sandra}},
  pages        = {{277 -- 295}},
  publisher    = {{Edition Praesens}},
  title        = {{{Von der Kanzleisprache zur Pressesprache im 'Hamburgischen Correspondenten' und seinen Vorgängern (1712 - 1801)}}},
  volume       = {{Band 9}},
  year         = {{2016}},
}

@inproceedings{11890,
  abstract     = {{In this paper we study the influence of directional radio patterns of Bluetooth low energy (BLE) beacons on smartphone localization accuracy and beacon network planning. A two-dimensional model of the power emission characteristic is derived from measurements of the radiation pattern of BLE beacons carried out in an RF chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived for this directional power emission model. With this lower bound on the RMS positioning error the coverage of different beacon network configurations can be evaluated. For near-optimal network planing an evolutionary optimization algorithm for finding the best beacon placement is presented.}},
  author       = {{Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}},
  booktitle    = {{24th European Signal Processing Conference (EUSIPCO 2016)}},
  title        = {{{Investigations into Bluetooth Low Energy Localization Precision Limits}}},
  year         = {{2016}},
}

@article{47912,
  abstract     = {{<jats:p> Factorial surveys (FSs) integrate elements of survey research and classical experiments. Using a large number of respondents in a controlled setting, FSs approximate complex and realistic judgment situations through so-called vignettes—that is, carefully designed descriptions of hypothetical people, social situations, or scenarios. Despite being rooted, and predominantly applied, in sociology, FSs are particularly promising for business and society (B&amp;S) scholars. Given the multiplicity, inherent complexity, and sometimes fuzziness of B&amp;S research objects, conventional research methods inevitably reach their limits. This article, therefore, systematically presents methodological and thematic opportunities for FS studies in B&amp;S research. It is argued that FSs are well suited to dealing with the complex interplay of societal-, organizational-, and individual-level factors in B&amp;S research and to studying the principles underlying human perceptions, attitudes, values, social norms, and (anticipated) behavior. The application of the FS method is illustrated based on a showcase example in the realm of socially responsible investments (SRIs). As the literature on the conceptualization of FSs is limited, methodological challenges are addressed to guide B&amp;S researchers past the common methodological pitfalls. </jats:p>}},
  author       = {{Oll, Josua and Hahn, Rüdiger and Reimsbach, Daniel and Kotzian, Peter}},
  issn         = {{0007-6503}},
  journal      = {{Business &amp; Society}},
  keywords     = {{Social Sciences (miscellaneous), Business, Management and Accounting (miscellaneous)}},
  number       = {{1}},
  pages        = {{26--59}},
  publisher    = {{SAGE Publications}},
  title        = {{{Tackling Complexity in Business and Society Research: The Methodological and Thematic Potential of Factorial Surveys}}},
  doi          = {{10.1177/0007650316645337}},
  volume       = {{57}},
  year         = {{2016}},
}

@inbook{48545,
  author       = {{Ziegele, Frank and Roessler, Isabel and Mordhorst, Lisa}},
  booktitle    = {{Jahrbuch Angewandte Hochschulbildung 2016}},
  editor       = {{Cai, Jingmin and Lackner, Hendrik}},
  pages        = {{159–174}},
  publisher    = {{Springer}},
  title        = {{{Hochschultyp im Wandel? Zur zukünftigen Rolle der Fachhochschule im deutschen Hochschulsystem}}},
  year         = {{2016}},
}

@article{48718,
  author       = {{Krause, Daniel and Effenberg, Alfred}},
  journal      = {{Ze-Phir}},
  number       = {{1}},
  pages        = {{12--13}},
  title        = {{{Zur Einrichtung einer Ethikkommission in der Deutschen Vereinigung für Sportwissenschaft.}}},
  volume       = {{23}},
  year         = {{2016}},
}

@article{48772,
  author       = {{Diederich, Julia}},
  journal      = {{Geschichte erleben und verstehen: "Als Oma und Opa Kinder waren"}},
  number       = {{295.296}},
  publisher    = {{Grundschulzeitschrift}},
  title        = {{{Willi wills wissen: Wie wird man Astronaut? Wie sieht die Welt im Weltraum aus?}}},
  year         = {{2016}},
}

@article{48771,
  author       = {{Becher, Andrea and Diederich, Julia}},
  journal      = {{Geschichte erleben und verstehen: "Als Oma und Opa Kinder waren"}},
  number       = {{295.296}},
  publisher    = {{Grundschulzeitschrift}},
  title        = {{{'Erzähl mir von früher!' – Kinder befragen Zeitzeugen}}},
  year         = {{2016}},
}

@article{49013,
  author       = {{Moritz, Tilman}},
  journal      = {{Katechetische Blätter}},
  number       = {{14}},
  pages        = {{246 -- 247}},
  title        = {{{Luther zwischen Image und Imagination}}},
  volume       = {{141}},
  year         = {{2016}},
}

@book{49056,
  abstract     = {{Erschienen anlässlich der Ausstellung Förderpreis für bildende Kunst der Landeshauptstadt Düsseldorf 2015, 10.12.2015-24.01.2016
}},
  author       = {{Schulze, Max}},
  pages        = {{16}},
  publisher    = {{Selbstverlag}},
  title        = {{{EPS}}},
  year         = {{2016}},
}

@article{4929,
  author       = {{Backes-Gellner, Uschi and Kluike, Marlies and Pull, Kerstin and Schneider, Martin and Teuber, Silvia}},
  journal      = {{Journal of Business Economics}},
  number       = {{7}},
  pages        = {{751----772}},
  title        = {{{Human resource management and radical innovation: a fuzzy-set QCA of US multinationals in Germany, Switzerland, and the UK}}},
  year         = {{2016}},
}

@misc{49187,
  author       = {{Gretz, Daniela}},
  booktitle    = {{Colloquia Germanica: Sonderheft zu ‹Zeitschriftenliteratur im 19. Jahrhundert›}},
  number       = {{H. 2-3}},
  pages        = {{305−328}},
  title        = {{{Poetik der Miszelle? Präliminarien zur Koevolution von periodischer Presse und modernem Roman mit Blick auf Raabes «Stopfkuchen» und einem Ausblick auf Fontanes «Stechlin»}}},
  volume       = {{49}},
  year         = {{2016}},
}

