Prof. Dr. Rolf Wanka

Scopus Autoren ID: 6602779198



Organisationseinheit


Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)


Preise / Auszeichnungen


2014 : Best Paper Award: Automatic Graph-based Success Tree Construction and Analysis
2013 : Best Paper Award: Particle Swarm Optimization Almost Surely Finds Local Optima
2009 : Best Paper Award: Particle Swarm Optimization with Velocity Adaptation



Projektleitung


AlKoP: Algorithmen für kombinatorische Probleme
Prof. Dr. Rolf Wanka
(13.03.2017)

Timetabling: Raum- und Zeitplanung der Lehre der Technischen Fakultät
Prof. Dr. Rolf Wanka
(01.04.2009 - 31.03.2020)

PSO: Partikelschwarm-Optimierung
Prof. Dr. Rolf Wanka
(24.07.2008 - 28.08.2020)


Mitarbeit in Forschungsprojekten


AlKoP: Algorithmen für kombinatorische Probleme
Prof. Dr. Rolf Wanka
(13.03.2017)

Timetabling: Raum- und Zeitplanung der Lehre der Technischen Fakultät
Prof. Dr. Rolf Wanka
(01.04.2009 - 31.03.2020)

PSO: Partikelschwarm-Optimierung
Prof. Dr. Rolf Wanka
(24.07.2008 - 28.08.2020)


Weitere Forschungsaktivitäten


Gremienmitgliedschaften / Funktionen (FAU-intern)
Prof. Dr. Rolf Wanka
Fakultätsrat (Mitglied)
(01.10.2015 - 30.09.2017)


Publikationen (Download BibTeX)

Go to first page Go to previous page 1 von 6 Go to next page Go to last page

Bassimir, B., & Wanka, R. (2018). Probabilistic Curriculum-based Examination Timetabling. In Edmund K. Burke, Luca Di Gaspero, Barry McCollum, Nysret Musliu, Ender Özcan (Eds.), Proc 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT) (pp. 273-285). Vienna, AT.
Mühlenthaler, M., Raß, A., Schmitt, M., Siegling, A., & Wanka, R. (2017). Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax. In ACM New York, NY, USA (Eds.), Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 13-24). Copenhagen, Denmark, DK.
Raß, A., Schmitt, M., & Wanka, R. (2015). Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis. In ACM New York, NY, USA (Eds.), Companion of Proc. 17th Genetic and Evolutionary Computation Conference (GECCO) (pp. 1463-1464). Madrid, Spain, ES.
Raß, A., Schmitt, M., & Wanka, R. (2015). Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis [Extended Version].
Schmitt, M., Wanka, R., & Schwab, L. (2015). Multimodal Medical Image Registration Using Particle Swarm Optimization with Influence of the Data's Initial Orientation. In Proc. 12th IEEE Conf. on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB) (pp. 403-410). Niagara Falls, CA.
Schmitt, M., & Wanka, R. (2015). Particle Swarm Optimization Almost Surely Finds Local Optima. Theoretical Computer Science, 561A, 57-72. https://dx.doi.org/10.1016/j.tcs.2014.05.017
Aliee, H., Glaß, M., Wanka, R., & Teich, J. (2014). Automatic Graph-based Success Tree Construction and Analysis. In Proc. 60th Annual Reliability and Maintainability Symposium (RAMS) (pp. 563-569). Colorado Springs, Colorado, USA.
Mühlenthaler, M., & Wanka, R. (2014). Fairness in Academic Course Timetabling. Annals of Operations Research. https://dx.doi.org/10.1007/s10479-014-1553-2
Bassimir, B., Schmitt, M., & Wanka, R. (2014). How Much Forcing is Necessary to Let the Results of Particle Swarms Converge? In Proc. Int. Conf. on Swarm Intelligence Based Optimization (ICSIBO) (pp. 98-105).
Mühlenthaler, M., & Wanka, R. (2014). The Connectedness of Clash-free Timetables. In Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) (pp. 330-346). York, UK.

Zuletzt aktualisiert 2019-22-01 um 17:51