@article{16150, author = {{Hüllermeier, Eyke}}, journal = {{Applied Soft Computing Journal}}, pages = {{1493--1505}}, title = {{{Fuzzy sets in machine learning and data mining}}}, year = {{2011}}, } @article{16153, author = {{Senge, Robin and Hüllermeier, Eyke}}, journal = {{IEEE Transactions on Fuzzy Systems}}, number = {{2}}, pages = {{241--252}}, title = {{{Top-down induction of fuzzy pattern trees}}}, volume = {{19}}, year = {{2011}}, } @inbook{16409, abstract = {{Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes. }}, author = {{Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel}}, booktitle = {{Automata, Languages and Programming}}, isbn = {{9783642220111}}, issn = {{0302-9743}}, title = {{{A New Approach for Analyzing Convergence Algorithms for Mobile Robots}}}, doi = {{10.1007/978-3-642-22012-8_52}}, year = {{2011}}, } @inproceedings{13194, author = {{Dembczynski, K. and Waegeman, W. and Cheng, W. and Hüllermeier, Eyke}}, booktitle = {{In Proceedings NIPS-2011, 25th Annual Conference on Neural Information Processing Systems, Granada, Spain}}, title = {{{An exact algorithm for F-measure maximization}}}, year = {{2011}}, } @inproceedings{13196, author = {{Fürnkranz, J. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings DS-2011, 14th International Conference on Discovery Science, number 6926 in LNAI}}, editor = {{Elomaa, T. and Hollmen, J. and Mannila, H.}}, pages = {{2--17}}, publisher = {{Springer}}, title = {{{Learning from label preferences}}}, year = {{2011}}, } @inproceedings{13197, author = {{Fallah Tehrani, A. and Cheng, W. and Dembczynski, K. and Hüllermeier, Eyke}}, booktitle = {{In Proceedings ECML/PKDD-2011, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Athens, Greece,}}, title = {{{Learning monotone nonlinear models using the Choquet integral}}}, year = {{2011}}, } @inproceedings{13198, author = {{Hüllermeier, Eyke and Schlegel, P.}}, booktitle = {{In Proceedings ICCBR-2011, 19th International Conference on Case-Based Reasoning, number 6880 in LNAI}}, editor = {{Ram, A. and Wiratunga, N.}}, pages = {{77--91}}, publisher = {{Springer}}, title = {{{Preference-based CBR: First steps toward a methodological framework}}}, year = {{2011}}, } @inproceedings{13588, author = {{Kotlowski, W. and Dembczynski, K. and Hüllermeier, Eyke}}, booktitle = {{in Proceedings ICML-2011, 28th International Conference on Machine Learning, Washington, USA}}, title = {{{Bipartite ranking through minimization of univariate loss}}}, year = {{2011}}, } @inproceedings{13643, author = {{Agne, Andreas and Platzner, Marco and Lübbers, Enno}}, booktitle = {{Proceedings of the International Conference on Field Programmable Logic and Applications (FPL)}}, isbn = {{9781457714849}}, pages = {{185--188}}, publisher = {{IEEE}}, title = {{{Memory Virtualization for Multithreaded Reconfigurable Hardware}}}, doi = {{10.1109/fpl.2011.42}}, year = {{2011}}, } @inproceedings{13644, author = {{Henkel, Jörg and Hedrich, Lars and Herkersdorf, Andreas and Kapitza, Rüdiger and Lohmann, Daniel and Marwedel, Peter and Platzner, Marco and Rosenstiel, Wolfgang and Schlichtmann, Ulf and Spinczyk, Olaf and Tahoori, Mehdi and Bauer, Lars and Teich, Jürgen and Wehn, Norbert and Wunderlich, Hans-Joachim and Becker, Joachim and Bringmann, Oliver and Brinkschulte, Uwe and Chakraborty, Samarjit and Engel, Michael and Ernst, Rolf and Härtig, Hermann}}, booktitle = {{Proceedings of the seventh IEEE/ACM/IFIP International Conference on Hardware/software Codesign and system synthesis - CODES+ISSS '11}}, isbn = {{9781450307154}}, title = {{{Design and architectures for dependable embedded systems}}}, doi = {{10.1145/2039370.2039384}}, year = {{2011}}, } @article{1376, author = {{Dannewitz, Christian and Biermann, Thorsten and Dräxler, Martin and Karl, Holger}}, issn = {{1798-2340}}, journal = {{Journal of Advances in Information Technology}}, number = {{1}}, publisher = {{Engineering and Technology Publishing}}, title = {{{Complex Queries in P2P Networks with Resource-Constrained Devices}}}, doi = {{10.4304/jait.2.1.2-14}}, volume = {{2}}, year = {{2011}}, } @inproceedings{46401, abstract = {{Exploratory Landscape Analysis subsumes a number of techniques employed to obtain knowledge about the properties of an unknown optimization problem, especially insofar as these properties are important for the performance of optimization algorithms. Where in a first attempt, one could rely on high-level features designed by experts, we approach the problem from a different angle here, namely by using relatively cheap low-level computer generated features. Interestingly, very few features are needed to separate the BBOB problem groups and also for relating a problem to high-level, expert designed features, paving the way for automatic algorithm selection.}}, author = {{Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Preuss, Mike and Weihs, Claus and Rudolph, Günter}}, booktitle = {{Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation}}, isbn = {{9781450305570}}, keywords = {{exploratory landscape analysis, evolutionary optimization, fitness landscape, benchmarking, BBOB test set}}, pages = {{829–836}}, publisher = {{Association for Computing Machinery}}, title = {{{Exploratory Landscape Analysis}}}, doi = {{10.1145/2001576.2001690}}, year = {{2011}}, } @inproceedings{46402, abstract = {{The use of multi-objective evolutionary algorithms for solving black-box problems with multiple conflicting objectives has become an important research area. However, when no gradient information is available, the examination of formal convergence or optimality criteria is often impossible. Thus, sophisticated heuristic online stopping criteria (OSC) have recently become subject of intensive research. In order to establish formal guidelines for a systematic research, we present a taxonomy of OSC in this paper. We integrate the known approaches within the taxonomy and discuss them by extracting their building blocks. The formal structure of the taxonomy is used as a basis for the implementation of a comprehensive MATLAB toolbox. Both contributions, the formal taxonomy and the MATLAB implementation, provide a framework for the analysis and evaluation of existing and new OSC approaches.}}, author = {{Wagner, Tobias and Trautmann, Heike and Martí, Luis}}, booktitle = {{Evolutionary Multi-Criterion Optimization}}, editor = {{Takahashi, Ricardo H. C. and Deb, Kalyanmoy and Wanner, Elizabeth F. and Greco, Salvatore}}, isbn = {{978-3-642-19893-9}}, pages = {{16–30}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms}}}, doi = {{https://doi.org/10.1007/978-3-642-19893-9_2}}, year = {{2011}}, } @article{46403, abstract = {{ Evolutionary (multi-objective optimization) algorithms (EMOAs) are widely accepted to be competitive optimization methods in industry today. However, normally only standard techniques are employed by the engineering experts. Here, it is shown how these standard techniques can be completed and improved with respect to interactivity to other tools, runtime, and parameterization. The coupling with metamodels serves as an example for the interactivity to other tools, while the online convergence detection relates to runtime, i.e. stopping criteria. Finally, sequential parameter optimization improves results focussing on parameter tuning. We show that invoking all these methods on their own already enhances EMOAs for aerodynamic applications. It is concluded with an outlook on how these methods might come together to foster aerospace applications and, at a time, widen the application area to multi-disciplinary optimization tasks. }}, author = {{Naujoks, B and Trautmann, Heike and Wessing, S and Weihs, C}}, journal = {{Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering}}, number = {{10}}, pages = {{1081--1096}}, title = {{{Advanced concepts for multi-objective evolutionary optimization in aircraft industry}}}, doi = {{10.1177/0954410011414120}}, volume = {{225}}, year = {{2011}}, } @phdthesis{2910, author = {{ Naewe, Stefanie}}, publisher = {{Universität Paderborn}}, title = {{{Algorithms for lattice problems with respect to general norms}}}, year = {{2011}}, } @inproceedings{37001, author = {{Becker, Markus and Zabel, Henning and Müller, Wolfgang and Elfeky, Ahmed}}, title = {{{Virtual Prototyping software-intensiver mechatronischer Systeme - Eine Fallstudie}}}, year = {{2011}}, } @inproceedings{37005, author = {{Kuznik, Christoph and Müller, Wolfgang}}, location = {{San Jose, CA}}, title = {{{A SystemC Based Library for Functional Coverage}}}, year = {{2011}}, } @inproceedings{37006, abstract = {{In this paper we present an approach for the configuration and reconfiguration of FlexRay networks to increase their fault tolerance. To guarantee a correct and deterministic system behavior, the FlexRay specification does not allow a reconfiguration of the schedapproachule during run time. To avoid the necessity of a complete bus restart in case of a node failure, we propose a reconfiguration using redundant slots in the schedule and/or combine messages in existing frames and slots, to compensate node failures and increase robustness. Our approach supports the developer to increase the fault tolerance of the system during the design phase. It is a heuristic, which, additionally to a determined initial configuration, calculates possible reconfigurations for the remaining nodes of the FlexRay network in case of a node failure, to keep the system working properly. An evaluation by means of realistic safety-critical automotive real-time systems revealed that it determines valid reconfigurations for up to 80% of possible individual node failures. In summary, our approach offers major support for the developer of FlexRay networks since the results provide helpful feedback about reconfiguration capabilities. In an iterative design process these information can be used to determine and optimize valid reconfigurations.}}, author = {{Klobedanz, Kay and König, Andreas and Müller, Wolfgang}}, booktitle = {{Proceedings of DATE'11}}, keywords = {{Schedules, Fault tolerant systems, Redundancy, Protocols, Automotive engineering, Genetic algorithms}}, location = {{Grenoble, France}}, publisher = {{IEEE}}, title = {{{A Reconfiguration Approach for Faul-Tolerant FlexRay Networks}}}, doi = {{10.1109/DATE.2011.5763022}}, year = {{2011}}, } @article{8178, abstract = {{In [Piani et al., PRL106 (2011) 220403], an activation protocol was introduced which maps the general non-classical (multipartite) correlations between given systems into bipartite entanglement between the systems and local ancillae by means of a potentially highly entangling interaction. Here, we study how this activation protocol can be used to entangle the starting systems themselves via entanglement swapping through a measurement on the ancillae. Furthermore, we bound the relative entropy of quantumness (a naturally arising measure of non-classicality in the scheme of Piani et al. above) for a special class of separable states, the so-called classical–quantum states. In particular, we fully characterize the classical–quantum two-qubit states that are maximally non-classical.}}, author = {{Gharibian, Sevag and PIANI, MARCO and ADESSO, GERARDO and CALSAMIGLIA, JOHN and HORODECKI, PAWEŁ}}, issn = {{0219-7499}}, journal = {{International Journal of Quantum Information}}, number = {{07n08}}, pages = {{1701--1713}}, publisher = {{World Scientific Pub Co Pte Lt}}, title = {{{Characterizing Quantumness via Entanglement Creation}}}, doi = {{10.1142/s0219749911008258}}, volume = {{09}}, year = {{2011}}, } @inproceedings{8176, abstract = {{Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the "exhaustive sampling method" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.}}, author = {{Gharibian, Sevag and Kempe, Julia}}, booktitle = {{IEEE Annual Conference on Computational Complexity (CCC 2011)}}, isbn = {{9781457701795}}, location = {{San Jose, USA}}, publisher = {{IEEE}}, title = {{{Approximation Algorithms for QMA-Complete Problems}}}, doi = {{10.1109/ccc.2011.15}}, year = {{2011}}, }