Rolf Wanka

According to our database1, Rolf Wanka authored at least 56 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Self-adaptive Potential-based Stopping Criteria for Particle Swarm Optimization.
CoRR, 2019

Exact Markov Chain-based Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax.
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
Fairness in academic course timetabling.
Annals OR, 2016

2015
Particle swarm optimization almost surely finds local optima.
Theor. Comput. Sci., 2015

Explanation of Stagnation at Points that are not Local Optima in Particle Swarm Optimization by Potential Analysis.
CoRR, 2015

On the Connectedness of Clash-free Timetables.
CoRR, 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
Towards a Better Understanding of the Local Attractor in Particle Swarm Optimization: Speed and Solution Quality.
CoRR, 2014

How Much Forcing Is Necessary to Let the Results of Particle Swarms Converge?
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
Exploiting independent subformulas: A faster approximation scheme for #k-SAT.
Inf. Process. Lett., 2013

Particles Prefer Walking Along the Axes: Experimental Insights into the Behavior of a Particle Swarm
CoRR, 2013

Fairness in Academic Course Timetabling
CoRR, 2013

Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT
CoRR, 2013

A Decomposition of the Max-min Fair Curriculum-based Course Timetabling Problem.
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

Particle swarm optimization almost surely finds local optima.
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
Heterogeneous constraint handling for particle swarm optimization.
Proceedings of the 2011 IEEE Symposium on Swarm Intelligence, 2011

Bitonic Sorting on Dynamically Reconfigurable Architectures.
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

Parallel Sorting - The Need for Speed.
Proceedings of the Algorithms Unplugged, 2011

2010
3-SAT on CUDA: Towards a massively parallel SAT solver.
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

Improving Bitonic Sorting by Wire Elimination.
Proceedings of the ARCS '10, 2010

2008
Paralleles Sortieren - Parallel geht schnell.
Proceedings of the Taschenbuch der Algorithmen, 2008

Multi-objective routing and topology optimization in networked embedded systems.
Proceedings of the 2008 International Conference on Embedded Computer Systems: Architectures, 2008

Theoretical Analysis of Initial Particle Swarm Behavior.
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

Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks.
Proceedings of the Architecture of Computing Systems, 2008

2007
Particle Swarm Optimization in High-Dimensional Bounded Search Spaces.
Proceedings of the 2007 IEEE Swarm Intelligence Symposium, 2007

Periodic Load Balancing on the N -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, 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

The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2002

2001
Parallel Bridging Models and Their Impact on Algorithm Design.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Periodification scheme: constructing sorting networks with constant period.
J. ACM, 2000

Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.
Proceedings of the 12th IEEE International Conference on Application-Specific Systems, 2000

1999
International Workshop on Communication and Data Management in Large Networks.
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
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.
Theory Comput. Syst., 1997

Playing Tetris on Meshes and Multi-Dimensional SHEARSORT.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

Efficient Oblivious Parallel Sorting on the MasPar MP-1.
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
Strongly Adaptive Token Distribution.
Algorithmica, 1996

1995
Paralleles Sortieren auf mehrdimensionalen Gittern.
PhD thesis, 1995

Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

1994
Sorting large data sets on a massively parallel system.
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Fast and Feasible Periodic Sorting Networks of Constant Depth
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Strongly Adaptive Token Distribution.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Periodic Sorting on Two-Dimensional Meshes.
Parallel Processing Letters, 1992

1989
Time-Optimal Simulations of Networks by Universal Parallel Computers.
Proceedings of the STACS 89, 1989


  Loading...