Rolf Wanka
Orcid: 0000-0002-5729-3727Affiliations:
- University of Erlangen-Nuremberg, Germany
According to our database1,
Rolf Wanka
authored at least 52 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on d-nb.info
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Robustness Approaches for the Examination Timetabling Problem under Data Uncertainty.
CoRR, 2023
2022
Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax.
Nat. Comput., 2022
2020
Self-adaptive potential-based stopping criteria for Particle Swarm Optimization with forced moves.
Swarm Intell., 2020
The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization.
CoRR, 2020
2019
CoRR, 2019
Runtime Analysis of Discrete Particle Swarm Optimization Applied to Shortest Paths Computation.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2019
2017
Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax.
Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2017
2016
2015
Theor. Comput. Sci., 2015
Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015
Multimodal medical image registration using particle swarm optimization with influence of the data's initial orientation.
Proceedings of the IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, 2015
2014
Proceedings of the Swarm Intelligence Based Optimization - First International Conference, 2014
Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality.
Proceedings of the Adaptive and Intelligent Systems - Third International Conference, 2014
2013
Inf. Process. Lett., 2013
CoRR, 2013
Particles prefer walking along the axes: experimental insights into the behavior of a particle swarm.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013
2012
The Spectral Relation between the Cube-Connected Cycles and the Shuffle-Exchange Network.
Proceedings of the ARCS 2012 Workshops, 28. Februar - 2. März 2012, München, Germany, 2012
2011
Proceedings of the 2011 IEEE Symposium on Swarm Intelligence, 2011
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011
Discrete Particle Swarm Optimization for TSP: Theoretical Results and Experimental Evaluations.
Proceedings of the Adaptive and Intelligent Systems - Second International Conference, 2011
2010
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010
Design and experimental evaluation of multiple adaptation layers in self-optimizing particle swarm optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010
2008
Proceedings of the Taschenbuch der Algorithmen, 2008
Proceedings of the 2008 International Conference on Embedded Computer Systems: Architectures, 2008
Proceedings of the Parallel Problem Solving from Nature, 2008
Social interaction in particle swarm optimization, the ranked FIPS, and adaptive multi-swarms.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008
Proceedings of the Architecture of Computing Systems, 2008
2007
Proceedings of the 2007 IEEE Swarm Intelligence Symposium, 2007
Periodic Load Balancing on the <i>N</i> -Cycle: Analytical and Experimental Evaluation.
Proceedings of the Euro-Par 2007, 2007
2006
Approximationsalgorithmen - eine Einführung.
Leitfäden der Informatik, Teubner, ISBN: 978-3-519-00444-8, 2006
2004
The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.
Presence Teleoperators Virtual Environ., 2004
2002
Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
2001
Proceedings of the Computational Science - ICCS 2001, 2001
2000
J. ACM, 2000
Proceedings of the 12th IEEE International Conference on Application-Specific Systems, 2000
1999
Proceedings of the Informatik '99, 1999
1998
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
1997
Theory Comput. Syst., 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997
Sorting on a Massively Parallel System Using a Library of Basic Primitives: Modeling and Experimental Results.
Proceedings of the Euro-Par '97 Parallel Processing, 1997
1996
1995
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995
1994
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1992
1989
Proceedings of the STACS 89, 1989