#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1989

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Yuval Rabani, Alistair Sinclair, Rolf Wanka
- FOCS
- 1998

We develop a general technique for the quantitative analysis of iterative distributed load balancing schemes. We illustrate the technique by studying two simple, intuitively appealing models that areâ€¦ (More)

- Friedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka
- Algorithmica
- 1993

The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: letM be a (parallel processor) network with setP of processors. Initially, each processorP âˆˆPâ€¦ (More)

- Sabine Helwig, Rolf Wanka
- 2007 IEEE Swarm Intelligence Symposium
- 2007

When applying particle swarm optimization (PSO) to real world optimization problems, often boundary constraints have to be taken into account. In this paper, we show that the bound handling mechanismâ€¦ (More)

- Manuel Schmitt, Rolf Wanka
- GECCO
- 2013

Particle swarm optimization (PSO) is a popular nature-inspired meta-heuristic for solving continuous optimization problems. Although this technique is widely used, up to now only some partial aspectsâ€¦ (More)

- Marcus Bednara, Oliver Beyer, JÃ¼rgen Teich, Rolf Wanka
- ASAP
- 2000

Sorting long sequences of keys is a problem that occurs in many different applications. For embedded systems, a uniprocessor software solution is often not applicable due to the low performance,â€¦ (More)

A periodic comparator network has depth (or period) k, if for every t > k, the compare-exchange operations performed at step t are executed between exactly the same registers as at step t k. Weâ€¦ (More)

- Sabine Helwig, Rolf Wanka
- PPSN
- 2008

In this paper, particle trajectories of PSO algorithms in the first iteration are studied. We will prove that many particles leave the search space at the beginning of the optimization process whenâ€¦ (More)

We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very largeâ€¦ (More)

- Quirin Meyer, Fabian SchÃ¶nfeld, Marc Stamminger, Rolf Wanka
- 2010 International Conference on High Performanceâ€¦
- 2010

This work presents the design and implementation of a massively parallel 3-SAT solver, specifically targeting random problem instances. Our approach is deterministic and features very littleâ€¦ (More)

- Rolf Wanka
- 1997

The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: let M be a (parallel processor) network with setP of processors. Initially, each processor Pâ€¦ (More)