@inbook{16392, author = {{Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}}, isbn = {{9783319125671}}, issn = {{0302-9743}}, title = {{{A Dynamic Distributed Data Structure for Top-k and k-Select Queries}}}, doi = {{10.1007/978-3-319-98355-4_18}}, year = {{2018}}, } @article{1430, author = {{Hoffmann, Sandro P. and Albert, Maximilian and Weber, Nils and Sievers, Denis and Förstner, Jens and Zentgraf, Thomas and Meier, Cedrik}}, issn = {{2330-4022}}, journal = {{ACS Photonics}}, keywords = {{tet_topic_phc}}, pages = {{1933--1942}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Tailored UV Emission by Nonlinear IR Excitation from ZnO Photonic Crystal Nanocavities}}}, doi = {{10.1021/acsphotonics.7b01228}}, volume = {{5}}, year = {{2018}}, } @article{13057, author = {{Kampmann, Matthias and Hellebrand, Sybille}}, journal = {{Microelectronics Reliability}}, pages = {{124--133}}, title = {{{Design For Small Delay Test - A Simulation Study}}}, volume = {{80}}, year = {{2018}}, } @misc{13072, author = {{Kampmann, Matthias and Hellebrand, Sybille}}, keywords = {{WORKSHOP}}, title = {{{Optimized Constraints for Scan-Chain Insertion for Faster-than-at-Speed Test}}}, year = {{2018}}, } @article{10129, abstract = {{There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the 5-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for 3-edge-colorable cubic graphs, cubic graphs which are not 3-edge-colorable, often called snarks, play a key role in this context. Here, we survey parameters measuring how far apart a non 3-edge-colorable graph is from being 3-edge-colorable. We study their interrelation and prove some new results. Besides getting new insight into the structure of snarks, we show that such measures give partial results with respect to these important conjectures. The paper closes with a list of open problems and conjectures.}}, author = {{Fiol, M. A. and Mazzuoccolo, Guiseppe and Steffen, Eckhard}}, journal = {{The Electronic Journal of Combinatorics}}, keywords = {{Cubic graph, Tait coloring, Snark, Boole coloring, Berge's conjecture, Tutte's 5-flow conjecture}}, number = {{4}}, title = {{{Measures of Edge-Uncolorability of Cubic Graphs}}}, volume = {{25}}, year = {{2018}}, } @article{10132, author = {{Jin, Ligang and Mazzuoccolo, Giuseppe and Steffen, Eckhard}}, issn = {{1234-3099}}, journal = {{Discussiones Mathematicae Graph Theory}}, pages = {{165--175}}, title = {{{Cores, joins and the Fano-flow conjectures}}}, doi = {{10.7151/dmgt.1999}}, volume = {{38}}, year = {{2018}}, } @article{10142, author = {{Steffen, Eckhard}}, journal = {{Australasian Journal of Combinatorics}}, number = {{1}}, pages = {{153--160}}, title = {{{Approximating Vizing’s independence number conjecture}}}, volume = {{71}}, year = {{2018}}, } @inproceedings{10145, author = {{Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}}, booktitle = {{Proc. 32 nd AAAI Conference on Artificial Intelligence (AAAI)}}, pages = {{2951--2958}}, title = {{{Learning to Rank Based on Analogical Reasoning}}}, year = {{2018}}, } @inproceedings{10148, author = {{El Mesaoudi-Paul, Adil and Hüllermeier, Eyke and Busa-Fekete, Robert}}, booktitle = {{Proc. 35th Int. Conference on Machine Learning (ICML)}}, pages = {{3469--3477}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Ranking Distributions based on Noisy Sorting}}}, year = {{2018}}, } @inproceedings{10149, author = {{Hesse, M. and Timmermann, J. and Hüllermeier, Eyke and Trächtler, Ansgar}}, booktitle = {{Proc. 4th Int. Conference on System-Integrated Intelligence: Intelligent, Flexible and Connected Systems in Products and Production, Procedia Manufacturing 24}}, pages = {{15--20}}, title = {{{A Reinforcement Learning Strategy for the Swing-Up of the Double Pendulum on a Cart}}}, year = {{2018}}, } @inbook{10152, author = {{Mencia, E.Loza and Fürnkranz, J. and Hüllermeier, Eyke and Rapp, M.}}, booktitle = {{Explainable and Interpretable Models in Computer Vision and Machine Learning}}, editor = {{Jair Escalante, H. and Escalera, S. and Guyon, I. and Baro, X. and Güclüütürk, Y. and Güclü, U. and van Gerven, M.A.J.}}, pages = {{81--113}}, publisher = {{Springer}}, title = {{{Learning interpretable rules for multi-label classification}}}, year = {{2018}}, } @inproceedings{10181, author = {{Nguyen, Vu-Linh and Destercke, Sebastian and Masson, M.-H. and Hüllermeier, Eyke}}, booktitle = {{Proc. 27th Int.Joint Conference on Artificial Intelligence (IJCAI)}}, pages = {{5089--5095}}, title = {{{Reliable Multi-class Classification based on Pairwise Epistemic and Aleatoric Uncertainty}}}, year = {{2018}}, } @inproceedings{10184, author = {{Schäfer, Dirk and Hüllermeier, Eyke}}, booktitle = {{Proc. 21st Int. Conference on Discovery Science (DS)}}, pages = {{161--175}}, title = {{{Preference-Based Reinforcement Learning Using Dyad Ranking}}}, year = {{2018}}, } @article{10276, author = {{Schäfer, Dirk and Hüllermeier, Eyke}}, journal = {{Machine Learning}}, number = {{5}}, pages = {{903--941}}, title = {{{Dyad Ranking Using Plackett-Luce Models based on joint feature representations}}}, volume = {{107}}, year = {{2018}}, } @article{10331, author = {{Kiesel, Johannes and Kneist, Florian and Alshomary, Milad and Stein, Benno and Hagen, Matthias and Potthast, Martin}}, issn = {{1936-1955}}, journal = {{Journal of Data and Information Quality}}, pages = {{1--25}}, title = {{{Reproducible Web Corpora}}}, doi = {{10.1145/3239574}}, year = {{2018}}, } @article{1369, abstract = {{In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.}}, author = {{Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}}, issn = {{1382-6905}}, journal = {{Journal of Combinatorial Optimization}}, publisher = {{Springer Nature}}, title = {{{Pure Nash equilibria in restricted budget games}}}, doi = {{10.1007/s10878-018-0269-7}}, year = {{2018}}, } @inproceedings{29888, author = {{Buchholz, Oleg and Böcker, Joachim}}, booktitle = {{2018 IEEE 27th International Symposium on Industrial Electronics (ISIE)}}, location = {{Cairns, QLD, Australia}}, publisher = {{IEEE}}, title = {{{Online-Identification of the Machine Parameters of an Induction Motor Drive}}}, doi = {{10.1109/isie.2018.8433852}}, year = {{2018}}, } @inproceedings{29912, author = {{Buchholz, Oleg and Böcker, Joachim}}, booktitle = {{2017 IEEE Southern Power Electronics Conference (SPEC)}}, location = {{ Puerto Varas, Chile}}, publisher = {{IEEE}}, title = {{{Gopinath-observer for flux estimation of an induction machine drive system}}}, doi = {{10.1109/spec.2017.8333614}}, year = {{2018}}, } @inproceedings{29911, author = {{Vogt, Thorsten and Badeda, Julia and Böcker, Joachim and Sauer, Dirk Uwe}}, booktitle = {{2017 IEEE 12th International Conference on Power Electronics and Drive Systems (PEDS)}}, location = {{Honolulu, HI, USA }}, publisher = {{IEEE}}, title = {{{Consideration on primary control reserve provision by industrial microgrids in grid-coupled operation}}}, doi = {{10.1109/peds.2017.8289189}}, year = {{2018}}, } @inproceedings{29905, author = {{Joy, Meryl Teresa and Böcker, Joachim}}, booktitle = {{2018 IEEE 9th International Symposium on Sensorless Control for Electrical Drives (SLED)}}, location = {{Helsinki, Finland }}, publisher = {{IEEE}}, title = {{{Sensorless Control of Induction Motor Drives Using Additional Windings on the Stator}}}, doi = {{10.1109/sled.2018.8486038}}, year = {{2018}}, }