[{"date_updated":"2023-10-16T13:45:12Z","intvolume":"       175","year":"2013","title":"Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems","author":[{"orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"},{"first_name":"C","last_name":"Dominguez-Medina","full_name":"Dominguez-Medina, C"},{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"}],"publication_identifier":{"isbn":["978-3-642-31518-3"]},"doi":"10.1007/978-3-642-31519-0_6","language":[{"iso":"eng"}],"series_title":"Advances in Intelligent Systems and Computing","abstract":[{"lang":"eng","text":"The averaged Hausdorff distance Δ p is a performance indicator in multi-objective evolutionary optimization which simultaneously takes into account proximity to the true Pareto front and uniform spread of solutions. Recently, the multi-objective evolutionary algorithm Δ p -EMOA was introduced which successfully generates evenly spaced Pareto front approximations for bi-objective problems by integrating an external archiving strategy into the SMS-EMOA based on Δ p . In this work a conceptual generalization of the Δ p -EMOA for higher objective space dimensions is presented and experimentally compared to state-of-the art EMOA as well as specialized EMOA variants on three-dimensional optimization problems."}],"publication":"EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II","type":"book_chapter","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:38:25Z","status":"public","user_id":"15504","volume":175,"editor":[{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Coello, Coello CA","last_name":"Coello","first_name":"Coello CA"},{"full_name":"Tantar, A","first_name":"A","last_name":"Tantar"},{"first_name":"E","last_name":"Tantar","full_name":"Tantar, E"},{"full_name":"Bouvry, P","first_name":"P","last_name":"Bouvry"},{"first_name":"Moral P","last_name":"Del","full_name":"Del, Moral P"},{"full_name":"Legrand, P","first_name":"P","last_name":"Legrand"}],"page":"89–105","_id":"46386","publisher":"Springer Berlin Heidelberg","citation":{"ama":"Trautmann H, Rudolph G, Dominguez-Medina C, Schütze O. Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems. In: Schütze O, Coello CC, Tantar A, et al., eds. <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>. Vol 175. Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg; 2013:89–105. doi:<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>","bibtex":"@inbook{Trautmann_Rudolph_Dominguez-Medina_Schütze_2013, series={Advances in Intelligent Systems and Computing}, title={Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems}, volume={175}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>}, booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike and Rudolph, G and Dominguez-Medina, C and Schütze, O}, editor={Schütze, O and Coello, Coello CA and Tantar, A and Tantar, E and Bouvry, P and Del, Moral P and Legrand, P}, year={2013}, pages={89–105}, collection={Advances in Intelligent Systems and Computing} }","mla":"Trautmann, Heike, et al. “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, edited by O Schütze et al., vol. 175, Springer Berlin Heidelberg, 2013, pp. 89–105, doi:<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>.","chicago":"Trautmann, Heike, G Rudolph, C Dominguez-Medina, and O Schütze. “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” In <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, edited by O Schütze, Coello CA Coello, A Tantar, E Tantar, P Bouvry, Moral P Del, and P Legrand, 175:89–105. Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">https://doi.org/10.1007/978-3-642-31519-0_6</a>.","short":"H. Trautmann, G. Rudolph, C. Dominguez-Medina, O. Schütze, in: O. Schütze, C.C. Coello, A. Tantar, E. Tantar, P. Bouvry, M.P. Del, P. Legrand (Eds.), EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II, Springer Berlin Heidelberg, 2013, pp. 89–105.","apa":"Trautmann, H., Rudolph, G., Dominguez-Medina, C., &#38; Schütze, O. (2013). Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems. In O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, &#38; P. Legrand (Eds.), <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i> (Vol. 175, pp. 89–105). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">https://doi.org/10.1007/978-3-642-31519-0_6</a>","ieee":"H. Trautmann, G. Rudolph, C. Dominguez-Medina, and O. Schütze, “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems,” in <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, vol. 175, O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, and P. Legrand, Eds. Springer Berlin Heidelberg, 2013, pp. 89–105."}},{"department":[{"_id":"34"},{"_id":"819"}],"type":"conference","keyword":["approximation algorithms","local search","traveling salesperson problem","feature selection","prediction","classification"],"date_created":"2023-08-04T15:42:03Z","abstract":[{"text":"Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With this paper, we contribute to this research direction and carry out a feature based comparison of local search and the well-known Christofides approximation algorithm for the Traveling Salesperson Problem. We use an evolutionary algorithm approach to construct easy and hard instances for the Christofides algorithm, where we measure hardness in terms of approximation ratio. Our results point out important features and lead to hard and easy instances for this famous algorithm. Furthermore, our cross-comparison gives new insights on the complementary benefits of the different approaches.","lang":"eng"}],"publication":"Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII","doi":"10.1145/2460239.2460253","series_title":"FOGA XII ’13","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:45:53Z","publication_identifier":{"isbn":["9781450319904"]},"author":[{"full_name":"Nallaperuma, Samadhi","last_name":"Nallaperuma","first_name":"Samadhi"},{"full_name":"Wagner, Markus","first_name":"Markus","last_name":"Wagner"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"},{"full_name":"Bischl, Bernd","last_name":"Bischl","first_name":"Bernd"},{"full_name":"Mersmann, Olaf","first_name":"Olaf","last_name":"Mersmann"},{"id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike"}],"title":"A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem","year":"2013","place":"New York, NY, USA","citation":{"mla":"Nallaperuma, Samadhi, et al. “A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem.” <i>Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII</i>, Association for Computing Machinery, 2013, pp. 147–160, doi:<a href=\"https://doi.org/10.1145/2460239.2460253\">10.1145/2460239.2460253</a>.","bibtex":"@inproceedings{Nallaperuma_Wagner_Neumann_Bischl_Mersmann_Trautmann_2013, place={New York, NY, USA}, series={FOGA XII ’13}, title={A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1145/2460239.2460253\">10.1145/2460239.2460253</a>}, booktitle={Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII}, publisher={Association for Computing Machinery}, author={Nallaperuma, Samadhi and Wagner, Markus and Neumann, Frank and Bischl, Bernd and Mersmann, Olaf and Trautmann, Heike}, year={2013}, pages={147–160}, collection={FOGA XII ’13} }","ama":"Nallaperuma S, Wagner M, Neumann F, Bischl B, Mersmann O, Trautmann H. A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem. In: <i>Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII</i>. FOGA XII ’13. Association for Computing Machinery; 2013:147–160. doi:<a href=\"https://doi.org/10.1145/2460239.2460253\">10.1145/2460239.2460253</a>","ieee":"S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, and H. Trautmann, “A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem,” in <i>Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII</i>, 2013, pp. 147–160, doi: <a href=\"https://doi.org/10.1145/2460239.2460253\">10.1145/2460239.2460253</a>.","apa":"Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., &#38; Trautmann, H. (2013). A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem. <i>Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII</i>, 147–160. <a href=\"https://doi.org/10.1145/2460239.2460253\">https://doi.org/10.1145/2460239.2460253</a>","chicago":"Nallaperuma, Samadhi, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann, and Heike Trautmann. “A Feature-Based Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson Problem.” In <i>Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII</i>, 147–160. FOGA XII ’13. New York, NY, USA: Association for Computing Machinery, 2013. <a href=\"https://doi.org/10.1145/2460239.2460253\">https://doi.org/10.1145/2460239.2460253</a>.","short":"S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, H. Trautmann, in: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII, Association for Computing Machinery, New York, NY, USA, 2013, pp. 147–160."},"user_id":"15504","_id":"46388","publisher":"Association for Computing Machinery","page":"147–160","status":"public"},{"_id":"46390","publisher":"Springer","page":"443–458","editor":[{"full_name":"Purshouse, RC","first_name":"RC","last_name":"Purshouse"},{"first_name":"PJ","last_name":"Fleming","full_name":"Fleming, PJ"},{"full_name":"Fonseca, CM","first_name":"CM","last_name":"Fonseca"},{"full_name":"Greco, S","first_name":"S","last_name":"Greco"},{"last_name":"Shaw","first_name":"J","full_name":"Shaw, J"}],"volume":7811,"user_id":"15504","status":"public","citation":{"short":"G. Rudolph, H. Trautmann, S. Sengupta, O. Schütze, in: R. Purshouse, P. Fleming, C. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings, Springer, 2013, pp. 443–458.","chicago":"Rudolph, G, Heike Trautmann, S Sengupta, and O Schütze. “Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.” In <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>, edited by RC Purshouse, PJ Fleming, CM Fonseca, S Greco, and J Shaw, 7811:443–458. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>.","apa":"Rudolph, G., Trautmann, H., Sengupta, S., &#38; Schütze, O. (2013). Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation. In R. Purshouse, P. Fleming, C. Fonseca, S. Greco, &#38; J. Shaw (Eds.), <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i> (Vol. 7811, pp. 443–458). Springer. <a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>","ieee":"G. Rudolph, H. Trautmann, S. Sengupta, and O. Schütze, “Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation,” in <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>, 2013, vol. 7811, pp. 443–458, doi: <a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>.","ama":"Rudolph G, Trautmann H, Sengupta S, Schütze O. Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation. In: Purshouse R, Fleming P, Fonseca C, Greco S, Shaw J, eds. <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>. Vol 7811. Lecture Notes in Computer Science. Springer; 2013:443–458. doi:<a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>","bibtex":"@inproceedings{Rudolph_Trautmann_Sengupta_Schütze_2013, series={Lecture Notes in Computer Science}, title={Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation}, volume={7811}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>}, booktitle={Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings}, publisher={Springer}, author={Rudolph, G and Trautmann, Heike and Sengupta, S and Schütze, O}, editor={Purshouse, RC and Fleming, PJ and Fonseca, CM and Greco, S and Shaw, J}, year={2013}, pages={443–458}, collection={Lecture Notes in Computer Science} }","mla":"Rudolph, G., et al. “Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.” <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>, edited by RC Purshouse et al., vol. 7811, Springer, 2013, pp. 443–458, doi:<a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>."},"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/978-3-642-37140-0_34","author":[{"last_name":"Rudolph","first_name":"G","full_name":"Rudolph, G"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Sengupta, S","last_name":"Sengupta","first_name":"S"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"}],"title":"Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation","year":"2013","intvolume":"      7811","date_updated":"2023-10-16T13:46:35Z","date_created":"2023-08-04T15:43:38Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","publication":"Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings","abstract":[{"text":"In some technical applications like multiobjective online control an evenly spaced approximation of the Pareto front is desired. Since standard evolutionary multiobjective optimization (EMO) algorithms have not been designed for that kind of approximation we propose an archive-based plug-in method that builds an evenly spaced approximation using averaged Hausdorff measure between archive and reference front. In case of three objectives this reference font is constructed from a triangulated approximation of the Pareto front from a previous experiment. The plug-in can be deployed in online or offline mode for any kind of EMO algorithm.","lang":"eng"}]},{"abstract":[{"lang":"eng","text":"Indicator based evolutionary algorithms have caught the interest of many researchers for the treatment of multi-objective optimization problems in the recent past since they deliver the desired approximation of the solution set and due to a usually better performance compared to dominance based algorithms. Nevertheless, these methods still suffer the drawback that many function evaluations are required to obtain a suitable representation of the solution set. The aim of this study is to present the Directed Search (DS) Method as local searcher within global indicator based optimization algorithms. For this, we will present the DS in the context of hypervolume maximization leading to both a new local search algorithm and a new memetic algorithm. Further, we will present first attempts to adapt the DS to a class of parameter dependent problems."}],"publication":"Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion","citation":{"bibtex":"@inproceedings{Sosa-Hernandez_Schütze_Rudoph_Trautmann_2013, place={New York, NY, USA}, series={GECCO ’13 Companion}, title={Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms}, DOI={<a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>}, booktitle={Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion}, publisher={ACM}, author={Sosa-Hernandez, VA and Schütze, O and Rudoph, G and Trautmann, Heike}, year={2013}, pages={1699–1702}, collection={GECCO ’13 Companion} }","ama":"Sosa-Hernandez V, Schütze O, Rudoph G, Trautmann H. Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms. In: <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>. GECCO ’13 Companion. ACM; 2013:1699–1702. doi:<a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>","mla":"Sosa-Hernandez, VA, et al. “Directed Search Method for Indicator-Based Multi-Objective Evolutionary Algorithms.” <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, ACM, 2013, pp. 1699–1702, doi:<a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>.","short":"V. Sosa-Hernandez, O. Schütze, G. Rudoph, H. Trautmann, in: Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion, ACM, New York, NY, USA, 2013, pp. 1699–1702.","chicago":"Sosa-Hernandez, VA, O Schütze, G Rudoph, and Heike Trautmann. “Directed Search Method for Indicator-Based Multi-Objective Evolutionary Algorithms.” In <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, 1699–1702. GECCO ’13 Companion. New York, NY, USA: ACM, 2013. <a href=\"https://doi.org/10.1145/2464576.2482756\">https://doi.org/10.1145/2464576.2482756</a>.","ieee":"V. Sosa-Hernandez, O. Schütze, G. Rudoph, and H. Trautmann, “Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms,” in <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, 2013, pp. 1699–1702, doi: <a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>.","apa":"Sosa-Hernandez, V., Schütze, O., Rudoph, G., &#38; Trautmann, H. (2013). Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms. <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, 1699–1702. <a href=\"https://doi.org/10.1145/2464576.2482756\">https://doi.org/10.1145/2464576.2482756</a>"},"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"place":"New York, NY, USA","date_created":"2023-08-04T15:45:26Z","date_updated":"2023-10-16T13:46:54Z","status":"public","year":"2013","title":"Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms","author":[{"full_name":"Sosa-Hernandez, VA","first_name":"VA","last_name":"Sosa-Hernandez"},{"last_name":"Schütze","first_name":"O","full_name":"Schütze, O"},{"full_name":"Rudoph, G","first_name":"G","last_name":"Rudoph"},{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike"}],"doi":"10.1145/2464576.2482756","user_id":"15504","page":"1699–1702","language":[{"iso":"eng"}],"_id":"46391","series_title":"GECCO ’13 Companion","publisher":"ACM"},{"author":[{"full_name":"Dominguez-Medina, C","last_name":"Dominguez-Medina","first_name":"C"},{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"year":"2013","title":"Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique","status":"public","date_updated":"2023-10-16T13:45:34Z","language":[{"iso":"eng"}],"_id":"46387","page":"3190–3197","user_id":"15504","doi":"https://doi.org/10.1109/CEC.2013.6557960","citation":{"ieee":"C. Dominguez-Medina, G. Rudolph, O. Schütze, and H. Trautmann, “Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique,” in <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 2013, pp. 3190–3197, doi: <a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>.","apa":"Dominguez-Medina, C., Rudolph, G., Schütze, O., &#38; Trautmann, H. (2013). Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique. <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 3190–3197. <a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>","chicago":"Dominguez-Medina, C, G Rudolph, O Schütze, and Heike Trautmann. “Evenly Spaced Pareto Fronts of Quad-Objective Problems Using PSA Partitioning Technique.” In <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 3190–3197. Cancun, Mexico, 2013. <a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>.","short":"C. Dominguez-Medina, G. Rudolph, O. Schütze, H. Trautmann, in: Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC), Cancun, Mexico, 2013, pp. 3190–3197.","mla":"Dominguez-Medina, C., et al. “Evenly Spaced Pareto Fronts of Quad-Objective Problems Using PSA Partitioning Technique.” <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 2013, pp. 3190–3197, doi:<a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>.","bibtex":"@inproceedings{Dominguez-Medina_Rudolph_Schütze_Trautmann_2013, place={Cancun, Mexico}, title={Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique}, DOI={<a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>}, booktitle={Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)}, author={Dominguez-Medina, C and Rudolph, G and Schütze, O and Trautmann, Heike}, year={2013}, pages={3190–3197} }","ama":"Dominguez-Medina C, Rudolph G, Schütze O, Trautmann H. Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique. In: <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2013:3190–3197. doi:<a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>"},"publication":"Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)","abstract":[{"text":"Here we address the problem of computing finite size Hausdorff approximations of the Pareto front of four-objective optimization problems by means of evolutionary computing. Since many applications desire an approximation evenly spread along the Pareto front and approximations that are good in the Hausdorff sense are typically evenly spread along the Pareto front we consider three different evolutionary multi-objective algorithms tailored to that purpose, where two of them are based on the Part and Selection Algorithm (PSA). Finally, we present some numerical results indicating the strength of the novel methods.","lang":"eng"}],"date_created":"2023-08-04T15:40:15Z","place":"Cancun, Mexico","department":[{"_id":"34"},{"_id":"819"}],"type":"conference"},{"abstract":[{"text":"Current StarCraft bots are not very flexible in their strategy choice, most of them just follow a manually optimized one, usually a rush. We suggest a method of augmenting existing bots via Fuzzy Control in order to make them react on the current game situation. According to the available information, the best matching of a pool of strategies is chosen. While the method is very general and can be applied easily to many bots, we implement it for the existing BTHAI bot and show experimentally how the modifications affects its gameplay, and how it is improved compared to the original version.","lang":"eng"}],"citation":{"mla":"Preuss, Mike, et al. “Reactive Strategy Choice in StarCraft by Means of Fuzzy Control.” <i>2013 IEEE Conference on Computational Inteligence in Games (CIG)</i>, 2013, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/CIG.2013.6633627\">10.1109/CIG.2013.6633627</a>.","ama":"Preuss M, Kozakowski D, Hagelbäck J, Trautmann H. Reactive strategy choice in StarCraft by means of Fuzzy Control. In: <i>2013 IEEE Conference on Computational Inteligence in Games (CIG)</i>. ; 2013:1-8. doi:<a href=\"https://doi.org/10.1109/CIG.2013.6633627\">10.1109/CIG.2013.6633627</a>","bibtex":"@inproceedings{Preuss_Kozakowski_Hagelbäck_Trautmann_2013, title={Reactive strategy choice in StarCraft by means of Fuzzy Control}, DOI={<a href=\"https://doi.org/10.1109/CIG.2013.6633627\">10.1109/CIG.2013.6633627</a>}, booktitle={2013 IEEE Conference on Computational Inteligence in Games (CIG)}, author={Preuss, Mike and Kozakowski, Daniel and Hagelbäck, Johan and Trautmann, Heike}, year={2013}, pages={1–8} }","apa":"Preuss, M., Kozakowski, D., Hagelbäck, J., &#38; Trautmann, H. (2013). Reactive strategy choice in StarCraft by means of Fuzzy Control. <i>2013 IEEE Conference on Computational Inteligence in Games (CIG)</i>, 1–8. <a href=\"https://doi.org/10.1109/CIG.2013.6633627\">https://doi.org/10.1109/CIG.2013.6633627</a>","ieee":"M. Preuss, D. Kozakowski, J. Hagelbäck, and H. Trautmann, “Reactive strategy choice in StarCraft by means of Fuzzy Control,” in <i>2013 IEEE Conference on Computational Inteligence in Games (CIG)</i>, 2013, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/CIG.2013.6633627\">10.1109/CIG.2013.6633627</a>.","short":"M. Preuss, D. Kozakowski, J. Hagelbäck, H. Trautmann, in: 2013 IEEE Conference on Computational Inteligence in Games (CIG), 2013, pp. 1–8.","chicago":"Preuss, Mike, Daniel Kozakowski, Johan Hagelbäck, and Heike Trautmann. “Reactive Strategy Choice in StarCraft by Means of Fuzzy Control.” In <i>2013 IEEE Conference on Computational Inteligence in Games (CIG)</i>, 1–8, 2013. <a href=\"https://doi.org/10.1109/CIG.2013.6633627\">https://doi.org/10.1109/CIG.2013.6633627</a>."},"publication":"2013 IEEE Conference on Computational Inteligence in Games (CIG)","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T15:42:58Z","date_updated":"2023-10-16T13:46:13Z","author":[{"first_name":"Mike","last_name":"Preuss","full_name":"Preuss, Mike"},{"full_name":"Kozakowski, Daniel","first_name":"Daniel","last_name":"Kozakowski"},{"first_name":"Johan","last_name":"Hagelbäck","full_name":"Hagelbäck, Johan"},{"orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"}],"title":"Reactive strategy choice in StarCraft by means of Fuzzy Control","status":"public","year":"2013","doi":"10.1109/CIG.2013.6633627","user_id":"15504","language":[{"iso":"eng"}],"_id":"46389","page":"1-8"},{"abstract":[{"lang":"eng","text":"In multiobjective optimization, the identification of practically relevant solutions on the Pareto-optimal front is an important research topic. Desirability functions (DFs) allow the preferences of the decision maker to be specified in an intuitive way. Recently, it has been shown for continuous optimization problems that an a priori transformation of the objectives by means of DFs can be used to focus the search of a hypervolume-based evolutionary algorithm on the desired part of the front. In many-objective optimization, however, the computational complexity of the hypervolume can become a crucial part. Thus, an alternative to this approach will be presented in this paper. The new algorithm operates in the untransformed objective space, but the desirability index (DI), that is, a DF-based scalarization, will be used as the second-level selection criterion in the non-dominated sorting. The diversity and uniform distribution of the resulting approximation are ensured by the use of an external archive. In the experiments, different preferences are specified as DFs, and their effects are investigated. It is shown that trade-off solutions are generated in the desired regions of the Pareto-optimal front and with a density adaptive to the DI. The efficiency of the approach with respect to increasing objective space dimension is also analysed using scalable test functions. The convergence speed is superior to other set-based and preference-based evolutionary multiobjective algorithms while the approach is of low computational complexity due to cheap DI evaluations. Copyright © 2013 John Wiley & Sons, Ltd."}],"issue":"5-6","publication":"Journal of Multi-Criteria Decision Analysis","citation":{"short":"H. Trautmann, T. Wagner, D. Biermann, C. Weihs, Journal of Multi-Criteria Decision Analysis 20 (2013) 319–337.","chicago":"Trautmann, Heike, T Wagner, D Biermann, and C Weihs. “Indicator-Based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index.” <i>Journal of Multi-Criteria Decision Analysis</i> 20, no. 5–6 (2013): 319–337. <a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>.","ieee":"H. Trautmann, T. Wagner, D. Biermann, and C. Weihs, “Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index,” <i>Journal of Multi-Criteria Decision Analysis</i>, vol. 20, no. 5–6, pp. 319–337, 2013, doi: <a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>.","apa":"Trautmann, H., Wagner, T., Biermann, D., &#38; Weihs, C. (2013). Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index. <i>Journal of Multi-Criteria Decision Analysis</i>, <i>20</i>(5–6), 319–337. <a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>","bibtex":"@article{Trautmann_Wagner_Biermann_Weihs_2013, title={Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index}, volume={20}, DOI={<a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>}, number={5–6}, journal={Journal of Multi-Criteria Decision Analysis}, author={Trautmann, Heike and Wagner, T and Biermann, D and Weihs, C}, year={2013}, pages={319–337} }","ama":"Trautmann H, Wagner T, Biermann D, Weihs C. Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index. <i>Journal of Multi-Criteria Decision Analysis</i>. 2013;20(5-6):319–337. doi:<a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>","mla":"Trautmann, Heike, et al. “Indicator-Based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index.” <i>Journal of Multi-Criteria Decision Analysis</i>, vol. 20, no. 5–6, 2013, pp. 319–337, doi:<a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>."},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:50:03Z","date_updated":"2023-10-16T13:48:31Z","intvolume":"        20","status":"public","title":"Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index","year":"2013","author":[{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"last_name":"Wagner","first_name":"T","full_name":"Wagner, T"},{"first_name":"D","last_name":"Biermann","full_name":"Biermann, D"},{"full_name":"Weihs, C","last_name":"Weihs","first_name":"C"}],"user_id":"15504","doi":"https://doi.org/10.1002/mcda.1503","volume":20,"page":"319–337","language":[{"iso":"eng"}],"_id":"46395"},{"status":"public","title":"Preference Articulation by Means of the R2 Indicator","year":"2013","publication_identifier":{"isbn":["978-3-642-37140-0"]},"author":[{"full_name":"Wagner, Tobias","first_name":"Tobias","last_name":"Wagner"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"},{"last_name":"Brockhoff","first_name":"Dimo","full_name":"Brockhoff, Dimo"}],"date_updated":"2023-10-16T13:47:58Z","page":"81–95","publisher":"Springer Berlin Heidelberg","_id":"46393","language":[{"iso":"eng"}],"user_id":"15504","editor":[{"full_name":"Purshouse, Robin C.","last_name":"Purshouse","first_name":"Robin C."},{"first_name":"Peter J.","last_name":"Fleming","full_name":"Fleming, Peter J."},{"full_name":"Fonseca, Carlos M.","last_name":"Fonseca","first_name":"Carlos M."},{"full_name":"Greco, Salvatore","last_name":"Greco","first_name":"Salvatore"},{"last_name":"Shaw","first_name":"Jane","full_name":"Shaw, Jane"}],"publication":"Evolutionary Multi-Criterion Optimization","citation":{"bibtex":"@inproceedings{Wagner_Trautmann_Brockhoff_2013, place={Berlin, Heidelberg}, title={Preference Articulation by Means of the R2 Indicator}, booktitle={Evolutionary Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner, Tobias and Trautmann, Heike and Brockhoff, Dimo}, editor={Purshouse, Robin C. and Fleming, Peter J. and Fonseca, Carlos M. and Greco, Salvatore and Shaw, Jane}, year={2013}, pages={81–95} }","ama":"Wagner T, Trautmann H, Brockhoff D. Preference Articulation by Means of the R2 Indicator. In: Purshouse RC, Fleming PJ, Fonseca CM, Greco S, Shaw J, eds. <i>Evolutionary Multi-Criterion Optimization</i>. Springer Berlin Heidelberg; 2013:81–95.","mla":"Wagner, Tobias, et al. “Preference Articulation by Means of the R2 Indicator.” <i>Evolutionary Multi-Criterion Optimization</i>, edited by Robin C. Purshouse et al., Springer Berlin Heidelberg, 2013, pp. 81–95.","short":"T. Wagner, H. Trautmann, D. Brockhoff, in: R.C. Purshouse, P.J. Fleming, C.M. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 81–95.","chicago":"Wagner, Tobias, Heike Trautmann, and Dimo Brockhoff. “Preference Articulation by Means of the R2 Indicator.” In <i>Evolutionary Multi-Criterion Optimization</i>, edited by Robin C. Purshouse, Peter J. Fleming, Carlos M. Fonseca, Salvatore Greco, and Jane Shaw, 81–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.","ieee":"T. Wagner, H. Trautmann, and D. Brockhoff, “Preference Articulation by Means of the R2 Indicator,” in <i>Evolutionary Multi-Criterion Optimization</i>, 2013, pp. 81–95.","apa":"Wagner, T., Trautmann, H., &#38; Brockhoff, D. (2013). Preference Articulation by Means of the R2 Indicator. In R. C. Purshouse, P. J. Fleming, C. M. Fonseca, S. Greco, &#38; J. Shaw (Eds.), <i>Evolutionary Multi-Criterion Optimization</i> (pp. 81–95). Springer Berlin Heidelberg."},"abstract":[{"lang":"eng","text":"In multi-objective optimization, set-based performance indicators have become the state of the art for assessing the quality of Pareto front approximations. As a consequence, they are also more and more used within the design of multi-objective optimization algorithms. The R2 and the Hypervolume (HV) indicator represent two popular examples. In order to understand the behavior and the approximations preferred by these indicators and algorithms, a comprehensive knowledge of the indicator’s properties is required. Whereas this knowledge is available for the HV, we presented a first approach in this direction for the R2 indicator just recently. In this paper, we build upon this knowledge and enhance the considerations with respect to the integration of preferences into the R2 indicator. More specifically, we analyze the effect of the reference point, the domain of the weights, and the distribution of weight vectors on the optimization of $\\mu$ solutions with respect to the R2 indicator. By means of theoretical findings and empirical evidence, we show the potentials of these three possibilities using the optimal distribution of $\\mu$ solutions for exemplary setups."}],"place":"Berlin, Heidelberg","date_created":"2023-08-04T15:47:49Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}]},{"_id":"46392","language":[{"iso":"eng"}],"publisher":"Springer Berlin Heidelberg","page":"70–74","editor":[{"full_name":"Nicosia, Giuseppe","last_name":"Nicosia","first_name":"Giuseppe"},{"first_name":"Panos","last_name":"Pardalos","full_name":"Pardalos, Panos"}],"user_id":"15504","author":[{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike"},{"first_name":"Tobias","last_name":"Wagner","full_name":"Wagner, Tobias"},{"full_name":"Brockhoff, Dimo","first_name":"Dimo","last_name":"Brockhoff"}],"publication_identifier":{"isbn":["978-3-642-44973-4"]},"year":"2013","status":"public","title":"R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection","date_updated":"2023-10-16T13:47:41Z","date_created":"2023-08-04T15:47:00Z","place":"Berlin, Heidelberg","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","citation":{"short":"H. Trautmann, T. Wagner, D. Brockhoff, in: G. Nicosia, P. Pardalos (Eds.), Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 70–74.","chicago":"Trautmann, Heike, Tobias Wagner, and Dimo Brockhoff. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.” In <i>Learning and Intelligent Optimization</i>, edited by Giuseppe Nicosia and Panos Pardalos, 70–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.","ieee":"H. Trautmann, T. Wagner, and D. Brockhoff, “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection,” in <i>Learning and Intelligent Optimization</i>, 2013, pp. 70–74.","apa":"Trautmann, H., Wagner, T., &#38; Brockhoff, D. (2013). R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. In G. Nicosia &#38; P. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 70–74). Springer Berlin Heidelberg.","bibtex":"@inproceedings{Trautmann_Wagner_Brockhoff_2013, place={Berlin, Heidelberg}, title={R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike and Wagner, Tobias and Brockhoff, Dimo}, editor={Nicosia, Giuseppe and Pardalos, Panos}, year={2013}, pages={70–74} }","ama":"Trautmann H, Wagner T, Brockhoff D. R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. In: Nicosia G, Pardalos P, eds. <i>Learning and Intelligent Optimization</i>. Springer Berlin Heidelberg; 2013:70–74.","mla":"Trautmann, Heike, et al. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.” <i>Learning and Intelligent Optimization</i>, edited by Giuseppe Nicosia and Panos Pardalos, Springer Berlin Heidelberg, 2013, pp. 70–74."},"publication":"Learning and Intelligent Optimization","abstract":[{"text":"An indicator-based evolutionary multiobjective optimization algorithm (EMOA) is introduced which incorporates the contribution to the unary R2-indicator as the secondary selection criterion. First experiments indicate that the R2-EMOA accurately approximates the Pareto front of the considered continuous multiobjective optimization problems. Furthermore, decision makers’ preferences can be included by adjusting the weight vector distributions of the indicator which results in a focused search behavior.","lang":"eng"}]},{"publication":"Positioning Navigation and Communication (WPNC), 2013 10th Workshop on","abstract":[{"text":"In this paper we present a system for indoor navigation based on received signal strength index information of Wireless-LAN access points and relative position estimates. The relative position information is gathered from inertial smartphone sensors using a step detection and an orientation estimate. Our map data is hosted on a server employing a map renderer and a SQL database. The database includes a complete multilevel office building, within which the user can navigate. During navigation, the client retrieves the position estimate from the server, together with the corresponding map tiles to visualize the user's position on the smartphone display.","lang":"eng"}],"related_material":{"link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2013/HoScDrTrScHa2013_Poster.pdf","relation":"supplementary_material","description":"Poster"}]},"date_created":"2019-07-12T05:28:51Z","department":[{"_id":"54"}],"type":"conference","keyword":["SQL","navigation","smart phones","wireless LAN","RSSI","SQL database","complete multilevel office building","inertial sensor information","inertial smartphone sensors","map renderer","received signal strength index information","relative position estimates","server based indoor navigation","step detection","wireless-LAN access points","Smartphone","fingerprint","indoor navigation","map tile"],"author":[{"last_name":"Hoang","first_name":"Manh Kha","full_name":"Hoang, Manh Kha"},{"full_name":"Schmitz, Sarah","first_name":"Sarah","last_name":"Schmitz"},{"full_name":"Drueke, Christian","first_name":"Christian","last_name":"Drueke"},{"last_name":"Vu","first_name":"Dang Hai Tran","full_name":"Vu, Dang Hai Tran"},{"id":"460","full_name":"Schmalenstroeer, Joerg","last_name":"Schmalenstroeer","first_name":"Joerg"},{"full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242"}],"title":"Server based indoor navigation using RSSI and inertial sensor information","year":"2013","date_updated":"2023-10-26T08:09:36Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2013/HoScDrTrScHa2013.pdf","open_access":"1"}],"doi":"10.1109/WPNC.2013.6533263","citation":{"short":"M.K. Hoang, S. Schmitz, C. Drueke, D.H.T. Vu, J. Schmalenstroeer, R. Haeb-Umbach, in: Positioning Navigation and Communication (WPNC), 2013 10th Workshop On, 2013, pp. 1–6.","chicago":"Hoang, Manh Kha, Sarah Schmitz, Christian Drueke, Dang Hai Tran Vu, Joerg Schmalenstroeer, and Reinhold Haeb-Umbach. “Server Based Indoor Navigation Using RSSI and Inertial Sensor Information.” In <i>Positioning Navigation and Communication (WPNC), 2013 10th Workshop On</i>, 1–6, 2013. <a href=\"https://doi.org/10.1109/WPNC.2013.6533263\">https://doi.org/10.1109/WPNC.2013.6533263</a>.","ieee":"M. K. Hoang, S. Schmitz, C. Drueke, D. H. T. Vu, J. Schmalenstroeer, and R. Haeb-Umbach, “Server based indoor navigation using RSSI and inertial sensor information,” in <i>Positioning Navigation and Communication (WPNC), 2013 10th Workshop on</i>, 2013, pp. 1–6, doi: <a href=\"https://doi.org/10.1109/WPNC.2013.6533263\">10.1109/WPNC.2013.6533263</a>.","apa":"Hoang, M. K., Schmitz, S., Drueke, C., Vu, D. H. T., Schmalenstroeer, J., &#38; Haeb-Umbach, R. (2013). Server based indoor navigation using RSSI and inertial sensor information. <i>Positioning Navigation and Communication (WPNC), 2013 10th Workshop On</i>, 1–6. <a href=\"https://doi.org/10.1109/WPNC.2013.6533263\">https://doi.org/10.1109/WPNC.2013.6533263</a>","bibtex":"@inproceedings{Hoang_Schmitz_Drueke_Vu_Schmalenstroeer_Haeb-Umbach_2013, title={Server based indoor navigation using RSSI and inertial sensor information}, DOI={<a href=\"https://doi.org/10.1109/WPNC.2013.6533263\">10.1109/WPNC.2013.6533263</a>}, booktitle={Positioning Navigation and Communication (WPNC), 2013 10th Workshop on}, author={Hoang, Manh Kha and Schmitz, Sarah and Drueke, Christian and Vu, Dang Hai Tran and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}, year={2013}, pages={1–6} }","ama":"Hoang MK, Schmitz S, Drueke C, Vu DHT, Schmalenstroeer J, Haeb-Umbach R. Server based indoor navigation using RSSI and inertial sensor information. In: <i>Positioning Navigation and Communication (WPNC), 2013 10th Workshop On</i>. ; 2013:1-6. doi:<a href=\"https://doi.org/10.1109/WPNC.2013.6533263\">10.1109/WPNC.2013.6533263</a>","mla":"Hoang, Manh Kha, et al. “Server Based Indoor Navigation Using RSSI and Inertial Sensor Information.” <i>Positioning Navigation and Communication (WPNC), 2013 10th Workshop On</i>, 2013, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/WPNC.2013.6533263\">10.1109/WPNC.2013.6533263</a>."},"quality_controlled":"1","oa":"1","status":"public","_id":"11818","page":"1-6","user_id":"460"},{"language":[{"iso":"eng"}],"_id":"11817","main_file_link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2013/HoScDrTrHa2013.pdf","open_access":"1"}],"user_id":"460","author":[{"full_name":"Hoang, Manh Kha","first_name":"Manh Kha","last_name":"Hoang"},{"full_name":"Schmalenstroeer, Joerg","last_name":"Schmalenstroeer","first_name":"Joerg","id":"460"},{"full_name":"Drueke, Christian","last_name":"Drueke","first_name":"Christian"},{"full_name":"Tran Vu, Dang Hai","last_name":"Tran Vu","first_name":"Dang Hai"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"}],"title":"A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection","status":"public","year":"2013","date_updated":"2023-10-26T08:09:45Z","date_created":"2019-07-12T05:28:50Z","oa":"1","department":[{"_id":"54"}],"type":"conference","citation":{"ieee":"M. K. Hoang, J. Schmalenstroeer, C. Drueke, D. H. Tran Vu, and R. Haeb-Umbach, “A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection,” 2013.","apa":"Hoang, M. K., Schmalenstroeer, J., Drueke, C., Tran Vu, D. H., &#38; Haeb-Umbach, R. (2013). A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection. <i>21th European Signal Processing Conference (EUSIPCO 2013)</i>.","chicago":"Hoang, Manh Kha, Joerg Schmalenstroeer, Christian Drueke, Dang Hai Tran Vu, and Reinhold Haeb-Umbach. “A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection.” In <i>21th European Signal Processing Conference (EUSIPCO 2013)</i>, 2013.","short":"M.K. Hoang, J. Schmalenstroeer, C. Drueke, D.H. Tran Vu, R. Haeb-Umbach, in: 21th European Signal Processing Conference (EUSIPCO 2013), 2013.","mla":"Hoang, Manh Kha, et al. “A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection.” <i>21th European Signal Processing Conference (EUSIPCO 2013)</i>, 2013.","bibtex":"@inproceedings{Hoang_Schmalenstroeer_Drueke_Tran Vu_Haeb-Umbach_2013, title={A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection}, booktitle={21th European Signal Processing Conference (EUSIPCO 2013)}, author={Hoang, Manh Kha and Schmalenstroeer, Joerg and Drueke, Christian and Tran Vu, Dang Hai and Haeb-Umbach, Reinhold}, year={2013} }","ama":"Hoang MK, Schmalenstroeer J, Drueke C, Tran Vu DH, Haeb-Umbach R. A Hidden Markov Model for Indoor User Tracking Based on WiFi Fingerprinting and Step Detection. In: <i>21th European Signal Processing Conference (EUSIPCO 2013)</i>. ; 2013."},"publication":"21th European Signal Processing Conference (EUSIPCO 2013)","abstract":[{"lang":"eng","text":"In this paper we present a modified hidden Markov model (HMM) for the fusion of received signal strength index (RSSI) information of WiFi access points and relative position information which is obtained from the inertial sensors of a smartphone for indoor positioning. Since the states of the HMM represent the potential user locations, their number determines the quantization error introduced by discretizing the allowable user positions through the use of the HMM. To reduce this quantization error we introduce â??pseudoâ?? states, whose emission probability, which models the RSSI measurements at this location, is synthesized from those of the neighboring states of which a Gaussian emission probability has been estimated during the training phase. The experimental results demonstrate the effectiveness of this approach. By introducing on average two pseudo states per original HMM state the positioning error could be significantly reduced without increasing the training effort."}],"related_material":{"link":[{"relation":"supplementary_material","url":"https://groups.uni-paderborn.de/nt/pubs/2013/HoScDrTrHa2013_Poster.pdf","description":"Poster"}]},"quality_controlled":"1"},{"citation":{"mla":"Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, no. 2, 2013, pp. 151–182, doi:<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>.","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>}, number={2}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Wagner, Markus and Bossek, Jakob and Neumann, Frank}, year={2013}, pages={151–182} }","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69(2):151–182. doi:<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, no. 2, pp. 151–182, 2013, doi: <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>(2), 151–182. <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">https://doi.org/10.1007/s10472-013-9341-2</a>","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182.","chicago":"Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69, no. 2 (2013): 151–182. <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">https://doi.org/10.1007/s10472-013-9341-2</a>."},"page":"151–182","_id":"48889","user_id":"102979","volume":69,"status":"public","date_created":"2023-11-14T15:58:59Z","keyword":["2-opt","90B06","Classification","Feature selection","MARS","TSP"],"type":"journal_article","department":[{"_id":"819"}],"issue":"2","publication":"Annals of Mathematics and Artificial Intelligence","abstract":[{"lang":"eng","text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"language":[{"iso":"eng"}],"doi":"10.1007/s10472-013-9341-2","year":"2013","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem","author":[{"full_name":"Mersmann, Olaf","first_name":"Olaf","last_name":"Mersmann"},{"full_name":"Bischl, Bernd","first_name":"Bernd","last_name":"Bischl"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"},{"full_name":"Wagner, Markus","last_name":"Wagner","first_name":"Markus"},{"id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"}],"publication_identifier":{"issn":["1012-2443"]},"date_updated":"2023-12-13T10:50:41Z","intvolume":"        69"},{"publication":"J. London Math. Soc.","citation":{"apa":"Hilgert, J., Laubinger, M., &#38; Alldridge, A. (2013). Harmonic analysis on Heisenberg-Clifford Lie supergroups. <i>J. London Math. Soc.</i>, <i>87</i>, 561–585.","ieee":"J. Hilgert, M. Laubinger, and A. Alldridge, “Harmonic analysis on Heisenberg-Clifford Lie supergroups,” <i>J. London Math. Soc.</i>, vol. 87, pp. 561–585, 2013.","chicago":"Hilgert, Joachim, M. Laubinger, and A. Alldridge. “Harmonic Analysis on Heisenberg-Clifford Lie Supergroups.” <i>J. London Math. Soc.</i> 87 (2013): 561–85.","short":"J. Hilgert, M. Laubinger, A. Alldridge, J. London Math. Soc. 87 (2013) 561–585.","mla":"Hilgert, Joachim, et al. “Harmonic Analysis on Heisenberg-Clifford Lie Supergroups.” <i>J. London Math. Soc.</i>, vol. 87, 2013, pp. 561–85.","ama":"Hilgert J, Laubinger M, Alldridge A. Harmonic analysis on Heisenberg-Clifford Lie supergroups. <i>J London Math Soc</i>. 2013;87:561-585.","bibtex":"@article{Hilgert_Laubinger_Alldridge_2013, title={Harmonic analysis on Heisenberg-Clifford Lie supergroups}, volume={87}, journal={J. London Math. Soc.}, author={Hilgert, Joachim and Laubinger, M. and Alldridge, A.}, year={2013}, pages={561–585} }"},"type":"journal_article","department":[{"_id":"91"}],"date_created":"2024-02-19T06:53:28Z","date_updated":"2024-02-19T06:54:41Z","publication_status":"published","intvolume":"        87","title":"Harmonic analysis on Heisenberg-Clifford Lie supergroups","year":"2013","status":"public","author":[{"id":"220","first_name":"Joachim","last_name":"Hilgert","full_name":"Hilgert, Joachim"},{"last_name":"Laubinger","first_name":"M.","full_name":"Laubinger, M."},{"first_name":"A.","last_name":"Alldridge","full_name":"Alldridge, A."}],"user_id":"49063","volume":87,"page":"561-585","language":[{"iso":"eng"}],"_id":"51395"},{"citation":{"short":"S. Prediger, L. Wessel, Mathematics Education Research Journal 25 (2013) 435–456.","chicago":"Prediger, Susanne, and Lena Wessel. “Fostering German-Language Learners’ Constructions of Meanings for Fractions—Design and Effects of a Language- and Mathematics-Integrated Intervention.” <i>Mathematics Education Research Journal</i> 25, no. 3 (2013): 435–56. <a href=\"https://doi.org/10.1007/s13394-013-0079-2\">https://doi.org/10.1007/s13394-013-0079-2</a>.","apa":"Prediger, S., &#38; Wessel, L. (2013). Fostering German-language learners’ constructions of meanings for fractions—design and effects of a language- and mathematics-integrated intervention. <i>Mathematics Education Research Journal</i>, <i>25</i>(3), 435–456. <a href=\"https://doi.org/10.1007/s13394-013-0079-2\">https://doi.org/10.1007/s13394-013-0079-2</a>","ieee":"S. Prediger and L. Wessel, “Fostering German-language learners’ constructions of meanings for fractions—design and effects of a language- and mathematics-integrated intervention,” <i>Mathematics Education Research Journal</i>, vol. 25, no. 3, pp. 435–456, 2013, doi: <a href=\"https://doi.org/10.1007/s13394-013-0079-2\">10.1007/s13394-013-0079-2</a>.","ama":"Prediger S, Wessel L. Fostering German-language learners’ constructions of meanings for fractions—design and effects of a language- and mathematics-integrated intervention. <i>Mathematics Education Research Journal</i>. 2013;25(3):435-456. doi:<a href=\"https://doi.org/10.1007/s13394-013-0079-2\">10.1007/s13394-013-0079-2</a>","bibtex":"@article{Prediger_Wessel_2013, title={Fostering German-language learners’ constructions of meanings for fractions—design and effects of a language- and mathematics-integrated intervention}, volume={25}, DOI={<a href=\"https://doi.org/10.1007/s13394-013-0079-2\">10.1007/s13394-013-0079-2</a>}, number={3}, journal={Mathematics Education Research Journal}, publisher={Springer Science and Business Media LLC}, author={Prediger, Susanne and Wessel, Lena}, year={2013}, pages={435–456} }","mla":"Prediger, Susanne, and Lena Wessel. “Fostering German-Language Learners’ Constructions of Meanings for Fractions—Design and Effects of a Language- and Mathematics-Integrated Intervention.” <i>Mathematics Education Research Journal</i>, vol. 25, no. 3, Springer Science and Business Media LLC, 2013, pp. 435–56, doi:<a href=\"https://doi.org/10.1007/s13394-013-0079-2\">10.1007/s13394-013-0079-2</a>."},"volume":25,"user_id":"37888","_id":"48332","publisher":"Springer Science and Business Media LLC","page":"435-456","status":"public","department":[{"_id":"643"}],"type":"journal_article","keyword":["Education","General Mathematics"],"date_created":"2023-10-19T10:00:32Z","issue":"3","publication":"Mathematics Education Research Journal","doi":"10.1007/s13394-013-0079-2","language":[{"iso":"eng"}],"intvolume":"        25","publication_status":"published","date_updated":"2024-04-18T09:05:03Z","author":[{"full_name":"Prediger, Susanne","first_name":"Susanne","last_name":"Prediger"},{"last_name":"Wessel","first_name":"Lena","full_name":"Wessel, Lena","id":"85190"}],"publication_identifier":{"issn":["1033-2170","2211-050X"]},"year":"2013","title":"Fostering German-language learners’ constructions of meanings for fractions—design and effects of a language- and mathematics-integrated intervention"},{"type":"book_chapter","department":[{"_id":"643"}],"place":"Münster","date_created":"2023-10-19T10:02:45Z","publication":"Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT","citation":{"chicago":"Prediger, Susanne, Lena Wessel, K Tschierschky, B Seipp, and E Özdil. “Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache.” In <i>Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT</i>, edited by S. Hußmann and C. Selter, 171–192. Münster: Waxmann, 2013.","ama":"Prediger S, Wessel L, Tschierschky K, Seipp B, Özdil E. Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache. In: Hußmann S, Selter C, eds. <i>Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT</i>. Waxmann; 2013:171–192.","short":"S. Prediger, L. Wessel, K. Tschierschky, B. Seipp, E. Özdil, in: S. Hußmann, C. Selter (Eds.), Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT, Waxmann, Münster, 2013, pp. 171–192.","bibtex":"@inbook{Prediger_Wessel_Tschierschky_Seipp_Özdil_2013, place={Münster}, title={Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache}, booktitle={Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT}, publisher={Waxmann}, author={Prediger, Susanne and Wessel, Lena and Tschierschky, K and Seipp, B and Özdil, E}, editor={Hußmann, S. and Selter, C.}, year={2013}, pages={171–192} }","apa":"Prediger, S., Wessel, L., Tschierschky, K., Seipp, B., &#38; Özdil, E. (2013). Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache. In S. Hußmann &#38; C. Selter (Eds.), <i>Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT</i> (pp. 171–192). Waxmann.","mla":"Prediger, Susanne, et al. “Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache.” <i>Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT</i>, edited by S. Hußmann and C. Selter, Waxmann, 2013, pp. 171–192.","ieee":"S. Prediger, L. Wessel, K. Tschierschky, B. Seipp, and E. Özdil, “Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache,” in <i>Diagnose und individuelle Förderung in der MINT-Lehrerbildung. Das Projekt dortMINT</i>, S. Hußmann and C. Selter, Eds. Münster: Waxmann, 2013, pp. 171–192."},"user_id":"37888","editor":[{"full_name":"Hußmann, S.","last_name":"Hußmann","first_name":"S."},{"full_name":"Selter, C.","last_name":"Selter","first_name":"C."}],"page":"171–192","language":[{"iso":"ger"}],"_id":"48333","publisher":"Waxmann","date_updated":"2024-04-18T09:07:27Z","year":"2013","status":"public","title":"Diagnose und Förderung schulpraktisch erproben-am Beispiel Mathematiklernen bei Deutsch als Zweitsprache","author":[{"full_name":"Prediger, Susanne","first_name":"Susanne","last_name":"Prediger"},{"id":"85190","full_name":"Wessel, Lena","last_name":"Wessel","first_name":"Lena"},{"full_name":"Tschierschky, K","first_name":"K","last_name":"Tschierschky"},{"last_name":"Seipp","first_name":"B","full_name":"Seipp, B"},{"full_name":"Özdil, E","first_name":"E","last_name":"Özdil"}]},{"date_created":"2023-10-19T09:53:39Z","department":[{"_id":"643"}],"type":"journal_article","citation":{"ieee":"S. Prediger, N. Krägeloh, and L. Wessel, “Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. ,” <i>Praxis der Mathematik in der Schule</i>, vol. 55, no. 52, pp. 9–14, 2013.","apa":"Prediger, S., Krägeloh, N., &#38; Wessel, L. (2013). Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. . <i>Praxis der Mathematik in der Schule</i>, <i>55</i>(52), 9–14.","short":"S. Prediger, N. Krägeloh, L. Wessel, Praxis der Mathematik in der Schule 55 (2013) 9–14.","chicago":"Prediger, Susanne, N. Krägeloh, and Lena Wessel. “Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. .” <i>Praxis der Mathematik in der Schule</i> 55, no. 52 (2013): 9–14.","mla":"Prediger, Susanne, et al. “Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. .” <i>Praxis der Mathematik in der Schule</i>, vol. 55, no. 52, 2013, pp. 9–14.","bibtex":"@article{Prediger_Krägeloh_Wessel_2013, title={Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. }, volume={55}, number={52}, journal={Praxis der Mathematik in der Schule}, author={Prediger, Susanne and Krägeloh, N. and Wessel, Lena}, year={2013}, pages={9–14} }","ama":"Prediger S, Krägeloh N, Wessel L. Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. . <i>Praxis der Mathematik in der Schule</i>. 2013;55(52):9-14."},"publication":"Praxis der Mathematik in der Schule","issue":"52","language":[{"iso":"ger"}],"_id":"48329","page":"9-14","volume":55,"user_id":"37888","author":[{"first_name":"Susanne","last_name":"Prediger","full_name":"Prediger, Susanne"},{"full_name":"Krägeloh, N.","first_name":"N.","last_name":"Krägeloh"},{"first_name":"Lena","last_name":"Wessel","full_name":"Wessel, Lena","id":"85190"}],"title":"Wieso 3/4 von 12, und wo ist der Kreis? Brüche für Teile von Mengen handlungs- und strukturorientiert erarbeiten. ","status":"public","year":"2013","intvolume":"        55","date_updated":"2024-04-18T09:08:20Z"},{"editor":[{"first_name":"G.","last_name":"Greefrath","full_name":"Greefrath, G."},{"full_name":"Käpnick, F.","first_name":"F.","last_name":"Käpnick"},{"full_name":"Stein, M.","last_name":"Stein","first_name":"M."}],"user_id":"37888","_id":"48395","language":[{"iso":"ger"}],"publisher":"WTM-Verlag","page":"1082-1085","main_file_link":[{"url":"https://eldorado.tu-dortmund.de/bitstream/2003/33663/3/BzMU2013_BAND1.pdf#page=337"}],"date_updated":"2024-04-18T09:17:02Z","author":[{"full_name":"Wessel, Lena","last_name":"Wessel","first_name":"Lena","id":"85190"}],"title":"Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende","year":"2013","status":"public","department":[{"_id":"643"}],"type":"book_chapter","place":"Münster","date_created":"2023-10-24T06:34:07Z","citation":{"short":"L. Wessel, in: G. Greefrath, F. Käpnick, M. Stein (Eds.), Beiträge zum Mathematikunterricht 2013, WTM-Verlag, Münster, 2013, pp. 1082–1085.","chicago":"Wessel, Lena. “Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende.” In <i>Beiträge zum Mathematikunterricht 2013</i>, edited by G. Greefrath, F. Käpnick, and M. Stein, 1082–85. Münster: WTM-Verlag, 2013.","apa":"Wessel, L. (2013). Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende. In G. Greefrath, F. Käpnick, &#38; M. Stein (Eds.), <i>Beiträge zum Mathematikunterricht 2013</i> (pp. 1082–1085). WTM-Verlag.","ieee":"L. Wessel, “Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende,” in <i>Beiträge zum Mathematikunterricht 2013</i>, G. Greefrath, F. Käpnick, and M. Stein, Eds. Münster: WTM-Verlag, 2013, pp. 1082–1085.","ama":"Wessel L. Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende. In: Greefrath G, Käpnick F, Stein M, eds. <i>Beiträge zum Mathematikunterricht 2013</i>. WTM-Verlag; 2013:1082-1085.","bibtex":"@inbook{Wessel_2013, place={Münster}, title={Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende}, booktitle={Beiträge zum Mathematikunterricht 2013}, publisher={WTM-Verlag}, author={Wessel, Lena}, editor={Greefrath, G. and Käpnick, F. and Stein, M.}, year={2013}, pages={1082–1085} }","mla":"Wessel, Lena. “Sprache und Vorstellungen parallel entwickeln – Wirkungen einer fach- und sprachintegrierten Förderung für sprachlich schwache Lernende.” <i>Beiträge zum Mathematikunterricht 2013</i>, edited by G. Greefrath et al., WTM-Verlag, 2013, pp. 1082–85."},"publication":"Beiträge zum Mathematikunterricht 2013"},{"department":[{"_id":"34"},{"_id":"858"}],"type":"conference","date_created":"2023-09-22T11:49:19Z","extern":"1","citation":{"short":"S. Fahl, M. Harbach, Y. Acar, M. Smith, in: Proceedings of the Ninth Symposium on Usable Privacy and Security, ACM, 2013.","chicago":"Fahl, Sascha, Marian Harbach, Yasemin Acar, and Matthew Smith. “On the Ecological Validity of a Password Study.” In <i>Proceedings of the Ninth Symposium on Usable Privacy and Security</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2501604.2501617\">https://doi.org/10.1145/2501604.2501617</a>.","ieee":"S. Fahl, M. Harbach, Y. Acar, and M. Smith, “On the ecological validity of a password study,” 2013, doi: <a href=\"https://doi.org/10.1145/2501604.2501617\">10.1145/2501604.2501617</a>.","apa":"Fahl, S., Harbach, M., Acar, Y., &#38; Smith, M. (2013). On the ecological validity of a password study. <i>Proceedings of the Ninth Symposium on Usable Privacy and Security</i>. <a href=\"https://doi.org/10.1145/2501604.2501617\">https://doi.org/10.1145/2501604.2501617</a>","bibtex":"@inproceedings{Fahl_Harbach_Acar_Smith_2013, title={On the ecological validity of a password study}, DOI={<a href=\"https://doi.org/10.1145/2501604.2501617\">10.1145/2501604.2501617</a>}, booktitle={Proceedings of the Ninth Symposium on Usable Privacy and Security}, publisher={ACM}, author={Fahl, Sascha and Harbach, Marian and Acar, Yasemin and Smith, Matthew}, year={2013} }","ama":"Fahl S, Harbach M, Acar Y, Smith M. On the ecological validity of a password study. In: <i>Proceedings of the Ninth Symposium on Usable Privacy and Security</i>. ACM; 2013. doi:<a href=\"https://doi.org/10.1145/2501604.2501617\">10.1145/2501604.2501617</a>","mla":"Fahl, Sascha, et al. “On the Ecological Validity of a Password Study.” <i>Proceedings of the Ninth Symposium on Usable Privacy and Security</i>, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2501604.2501617\">10.1145/2501604.2501617</a>."},"publication":"Proceedings of the Ninth Symposium on Usable Privacy and Security","doi":"10.1145/2501604.2501617","user_id":"14931","_id":"47161","language":[{"iso":"eng"}],"publisher":"ACM","date_updated":"2024-06-05T13:17:57Z","publication_status":"published","author":[{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"},{"last_name":"Harbach","first_name":"Marian","full_name":"Harbach, Marian"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"last_name":"Smith","first_name":"Matthew","full_name":"Smith, Matthew"}],"status":"public","year":"2013","title":"On the ecological validity of a password study"},{"user_id":"15504","volume":69,"page":"151–182","language":[{"iso":"eng"}],"_id":"46394","date_updated":"2024-06-10T11:57:43Z","intvolume":"        69","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem","year":"2013","status":"public","author":[{"last_name":"Mersmann","first_name":"O","full_name":"Mersmann, O"},{"full_name":"Bischl, B","last_name":"Bischl","first_name":"B"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","id":"100740"},{"full_name":"Wagner, M","first_name":"M","last_name":"Wagner"},{"id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"first_name":"F","last_name":"Neumann","full_name":"Neumann, F"}],"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:48:57Z","abstract":[{"text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt.","lang":"eng"}],"publication":"Annals of Mathematics and Artificial Intelligence","citation":{"chicago":"Mersmann, O, B Bischl, Heike Trautmann, M Wagner, Jakob Bossek, and F Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69 (2013): 151–182.","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182.","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69:151–182.","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem}, volume={69}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, O and Bischl, B and Trautmann, Heike and Wagner, M and Bossek, Jakob and Neumann, F}, year={2013}, pages={151–182} }","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>, 151–182.","mla":"Mersmann, O., et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, 2013, pp. 151–182.","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, pp. 151–182, 2013."}},{"date_created":"2024-02-19T10:17:34Z","type":"book","department":[{"_id":"91"}],"citation":{"chicago":"Hilgert, Joachim. <i>Arbeitsbuch Mathematik für das erste Studienjahr</i>. Springer Spektrum, 2013.","short":"J. Hilgert, Arbeitsbuch Mathematik für das erste Studienjahr, Springer Spektrum, 2013.","ieee":"J. Hilgert, <i>Arbeitsbuch Mathematik für das erste Studienjahr</i>. Springer Spektrum, 2013.","apa":"Hilgert, J. (2013). <i>Arbeitsbuch Mathematik für das erste Studienjahr</i>. Springer Spektrum.","bibtex":"@book{Hilgert_2013, title={Arbeitsbuch Mathematik für das erste Studienjahr}, publisher={Springer Spektrum}, author={Hilgert, Joachim}, year={2013} }","ama":"Hilgert J. <i>Arbeitsbuch Mathematik für das erste Studienjahr</i>. Springer Spektrum; 2013.","mla":"Hilgert, Joachim. <i>Arbeitsbuch Mathematik für das erste Studienjahr</i>. Springer Spektrum, 2013."},"main_file_link":[{"url":"https://link.springer.com/book/10.1007/978-3-642-37550-7"}],"_id":"51490","publisher":"Springer Spektrum","language":[{"iso":"ger"}],"user_id":"220","year":"2013","title":"Arbeitsbuch Mathematik für das erste Studienjahr","status":"public","author":[{"id":"220","first_name":"Joachim","last_name":"Hilgert","full_name":"Hilgert, Joachim"}],"publication_status":"published","date_updated":"2024-08-08T07:38:30Z"}]