#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1990

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Janett Prehl, Christopher Essex, Karl-Heinz Hoffmann
- Entropy
- 2012

- Thomas Streubel, Karl-Heinz Hoffmann
- 2014 IEEE Intelligent Vehicles Symposium…
- 2014

The complexity of situations occurring at intersections is demanding on the cognitive abilities of drivers. Advanced Driver Assistance Systems (ADAS) are intended to assist particularly in those situations. However, for adequate system reaction strategies it is essential to develop situation assessment. Especially the driver's intention has to be estimated.… (More)

- Janett Prehl, Frank Boldt, Christopher Essex, Karl-Heinz Hoffmann
- Entropy
- 2013

- Peter Salamon, Karl-Heinz Hoffmann, Anatoly Tsirlin
- Appl. Math. Lett.
- 2012

- Sven Schubert, Karl-Heinz Hoffmann
- Computer Physics Communications
- 2006

- Astrid Franz, Karl-Heinz Hoffmann
- Appl. Math. Lett.
- 2003

- Karl-Heinz Hoffmann, Peter Salamon
- Appl. Math. Lett.
- 2009

Forming lumped states in a Markov chain is a very useful device leading to a coarser level of description. The Markov chain on these lumped states is often taken as an approximation for the time evolution of the unlumped chain. In the present work we derive a bound on the error in this approximation.

- Christian Schulzky, Astrid Franz, Karl-Heinz Hoffmann
- ACM SIGSAM Bulletin
- 2000

We present a new algorithm to calculate the random walk dimensionof finitely ramified Sierpinski carpets. The fractal structure isinterpreted as a resistor network for which the resistance scalingexponent is calculated using Mathematica. A fractal form of theEinstein relation, which connects diffusion with conductivity, isused to give a numerical value for… (More)

- Jörg Lässig, Karl-Heinz Hoffmann, Mihaela Enachescu
- GECCO
- 2008

The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatorial optimization problem. Many different schemes have been considered in literature as possible selection strategies, such as Windowing, Exponential reduction, Linear transformation or… (More)