Friedrich-Alexander-Universität DruckenUnivisEnglish FAU-Logo
Techn. Fakultät Willkommen am Department Informatik FAU-Logo
Codesign
Lehrstuhl für Informatik 12
Veröffentlichungen
Home
Forschung/Research
Lehre/Teaching
Aufgaben/Administration

Department Informatik  >  Informatik 12  >  Personal  >  Rolf Wanka  >  Veröffentlichungen

In Databases

Rolf Wanka's Publications:

Books

Papers

2017
  • Mühlenthaler, M.; Raß, A.; Schmitt, M.; Siegling, A.; Wanka, R.:
    Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax;
    in: Proc. 14th ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA), 2017, to appear. (More Information)
2015
  • Schwab, L.; Schmitt, M.; Wanka, R.:
    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, 2015. (More Information)
    [doi:10.1109/CIBCB.2015.7300314]

  • Raß, A.; Schmitt, M.; Wanka, R.:
    Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis;
    in: Companion of Proc. 17th Genetic and Evolutionary Computation Conference (GECCO); pp. 1463-1464, 2015. (More Information)
    [doi:10.1145/2739482.2764654]

  • Schmitt, M. ; Wanka, R.:
    Particle Swarm Optimization Almost Surely Finds Local Optima;
    Theoretical Computer Science, 561A (2015) 57-72. (Extended version of the GECCO 2013 paper, see below) (More Information)
    [doi:10.1016/j.tcs.2014.05.017]
2014
  • Lange, V. ; Schmitt, M. ; Wanka, R.:
    Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality;
    in: Proc. 3rd International Conference on Adaptive and Intelligent Systems (ICAIS); pp. 90-99, 2014. (More Information)
    [doi:10.1007/978-3-319-11298-5_10]

  • Mühlenthaler, M. ; Wanka, R.:
    The Connectedness of Clash-free Timetables;
    in: Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), pp. 330--346, 2014. (More Information)

  • Bassimir, B.; Schmitt, M.; Wanka, R.:
    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, 2014. (More Information)
    [doi:10.1007/978-3-319-12970-9_11]

  • Mühlenthaler, M.; Wanka, R.:
    Fairness in Academic Course Timetabling;
    Annals of Operations Research, 2014. (Full version of the PATAT 2012 paper, see below) (More Information)
    [doi:10.1007/s10479-014-1553-2]

  • Aliee, H.; Glass, M.; Wanka, R.; Teich, J.:
    Automatic Graph-based Success Tree Construction and Analysis;
    in: Proc. 60th Annual Reliability and Maintainability Symposium (RAMS), pp. 563-569, 2014 [P. K. McElroy / R. A. Evans Best Paper Award]. (More Information)
    [doi:10.1109/RAMS.2014.6798487]
2013
  • Mühlenthaler, M.; Wanka, R.:
    A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem: The Impact of Solving Subproblems to Optimality;
    in: Proc. 6th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA), pp. 300-313, 2013. (More Information)

  • Schmitt, M.; Wanka, R.:
    Particle Swarm Optimization Almost Surely Finds Local Optima;
    in: Proc. 15th Genetic and Evolutionary Computation Conference (GECCO); pp. 1629-1636, 2013 [Best Paper Award]. (More Information)
    [doi:10.1145/2463372.2463563]

  • Schmitt, M.; Wanka, R.:
    Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm;
    in: Companion of Proc. 15th Genetic and Evolutionary Computation Conference (GECCO); pp. 17-18, 2013. (More Information)
    [doi:10.1145/2464576.2464583]

  • Schmitt, M.; Wanka, R.:
    Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT;
    Information Processing Letters 113 (2013) 337-344. (More Information)
    [doi:10.1016/j.ipl.2013.02.013]
2012
  • Mühlenthaler, M. ; Wanka, R.:
    Fairness in Academic Course Timetabling;
    in: Proc. 9th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), pp. 114--130, 2012. (More Information)

  • Riess, Ch..; Strehl, V.; Wanka, R.:
    The Spectral Relation between the Cube-Connected Cycles and the Shuffle-Exchange Network;
    in: Proc. 10th Workshop on Parallel Systems and Algorithms (PASA) of the 25th Int. Conf. on Architecture of Computing Systems (ARCS); pp. 505-516, 2012. (More Information)
    [IEEE Xplore]
2011
  • Hoffmann, M.; Mühlenthaler, M.; Helwig, S.; Wanka, R.:
    Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations.
    in: Proc. International Conference on Adaptive and Intelligent Systems (ICAIS); pp. 416-427, 2011. (More Information)
    [doi:10.1007/978-3-642-23857-4_40]

  • Angermeier, J.; Sibirko, E.; Wanka, R.; Teich J.:
    Bitonic Sorting on Dynamically Reconfigurable Architectures;
    in: Proc. 18th IEEE Reconfigurable Architectures Workshop (RAW), pp. 309-312, 2011. (More Information)
    [doi:10.1109/IPDPS.2011.164]

  • Omeltschuk, L.; Helwig, S.; Mühlenthaler, M.; Wanka, R.:
    Heterogeneous Constraint Handling for Particle Swarm Optimization;
    Proc. IEEE Swarm Intelligence Symposium (SIS), pp. 37-43, 2011. (More Information)
    [doi:10.1109/SIS.2011.5952578]

  • Helwig, S.; Neumann, F.; Wanka, R.:
    Velocity Adaptation in Particle Swarm Optimization;
    in: Handbook of Swarm Intelligence - Concepts, Principles and Applications, Springer, pp. 155-173, 2011. (More Information)
    [doi:10.1007/978-3-642-17390-5_7]

  • Wanka, R.:
    Parallel Sorting - The Need for Speed;
    in: Vöcking et al. (Eds) Algorithms Unplugged; Springer; pp. 27-37, 2011.
    [doi:10.1007/978-3-642-15328-0_4]
2010
  • Mühlenthaler, M. ; Wanka, R.:
    A Novel Event Insertion Heuristic for Finding Feasible Solutions of Course Timetabling Problems;
    in: Proc. 8th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) 2010, pp. 294-304. (More Information)

  • Meyer, Q.; Schönfeld, F.; Stamminger, M.; Wanka, R.:
    3-SAT on CUDA: Towards a Massively Parallel SAT Solver;
    in: Proc. High Performance Computing and Simulation Conference (HPSC) 2010, pp. 306-313. (More Information)
    [doi:10.1109/HPCS.2010.5547116]

  • Ritscher, Th.; Helwig S.; Wanka, R.:
    Design and Experimental Evaluation of Multiple Adaptation Layers in Self-optimizing Particle Swarm Optimization;
    in: Proc. IEEE Congress on Evolutionary Computation (CEC) 2010. (More Information)
    [doi:10.1109/CEC.2010.5586255]

  • Mühlenthaler, M. ; Wanka, R.:
    Improving Bitonic Sorting by Wire Elimination;
    in: Proc. 23rd PARS-Workshop on Parallel Systems and Architectures of the 23rd Int. Conf. on Architecture of Computing Systems (ARCS); pp. 15--22, 2010. (More Information)
2009
  • Helwig, S.; Neumann, F.; Wanka, R.:
    Particle Swarm Optimization with Velocity Adaptation;
    in: Proc. International Conference on Adaptive and Intelligent Systems (ICAIS); pp. 146-151, 2009. [Best Paper Award]. (More Information)
    [doi:10.1109/ICAIS.2009.32]
2008
  • Helwig, S.; Wanka, R.:
    Theoretical Analysis of Initial Particle Swarm Behavior;
    in: Proc. 10th International Conference on Parallel Problem Solving from Nature (PPSN); pp. 889-898, 2008. (More Information)
    [doi:10.1007/978-3-540-87700-4_88]

  • Jordan, J.; Helwig, S.; Wanka, R.:
    Social Interaction in Particle Swarm Optimization, the Ranked FIPS, and Adaptive Multi-Swarms;
    in: Proc. Genetic and Evolutionary Computation Conference (GECCO); pp. 49-56, 2008. (More Information)
    [doi:10.1145/1389095.1389103]

  • Glaß, M.; Lukasiewycz, M.; Wanka, R.; Haubelt, Ch.; Teich, J..:
    Multi-Objective Routing and Topology Optimization in Networked Embedded Systems;
    in: Proc. 8th Int. Conf. on Embedded Computer Systems: Architectures, Modeling, and Simulation (IC-SAMOS); pp. 74-81, 2008.
    [doi:10.1109/ICSAMOS.2008.4664849]

  • Wanka, R.:
    Paralleles Sortieren - Parallel geht schnell;
    Taschenbuch der Algorithmen; Springer; pp. 31-41, 2008. (PDF (469,2 KB) on SpringerLink)
    [doi:10.1007/978-3-540-76394-9_4]

  • Streichert T.; Glaß, M.; Wanka R.; Haubelt, Ch., Teich, J.:
    Topology-aware Replica Placement in Fault-tolerant Embedded Networks;
    in: Proc. 21st Int. Conf. on Architecture of Computing Systems (ARCS); pp.23-37, 2008. (More Information)
    [doi:10.1007/978-3-540-78153-0_4]
2007 - 1989

© Copyright Notice:
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

  Impressum Stand: 06 February 2007.   R.W.