Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Johannsen, Daniel"'
Autor:
Johannsen, Daniel
In dieser Arbeit werden Materialmodelle vorgestellt, die Kopplungseffekte zwischen makro- und mikroskopischen Längenskalenbereiche berücksichtigen. Die Theorie dieser Modelle ist in der Lage, bei einem Übergang zu kleineren Bauteilabmessungen eine
Externí odkaz:
https://tuprints.ulb.tu-darmstadt.de/4049/13/Johannsen_Daniel_Dissertation_Online3.pdf
Autor:
Hoeltgen, Laurent, Mainberger, Markus, Hoffmann, Sebastian, Weickert, Joachim, Tang, Ching Hoo, Setzer, Simon, Johannsen, Daniel, Neumann, Frank, Doerr, Benjamin
Some recent methods for lossy signal and image compression store only a few selected pixels and fill in the missing structures by inpainting with a partial differential equation (PDE). Suitable operators include the Laplacian, the biharmonic operator
Externí odkaz:
http://arxiv.org/abs/1506.04566
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorithm. Recently, the analysis of this algorithm was refined and it was sh
Externí odkaz:
http://arxiv.org/abs/1207.0369
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of attention.
Externí odkaz:
http://arxiv.org/abs/1108.4647
Publikováno v:
Algorithmica, 2012, Volume 64, Issue 4, pp 673-697
In this work, we introduce multiplicative drift analysis as a suitable way to analyze the runtime of randomized search heuristics such as evolutionary algorithms. We give a multiplicative version of the classical drift theorem. This allows easier ana
Externí odkaz:
http://arxiv.org/abs/1101.0776
Autor:
Doerr, Benjamin, Johannsen, Daniel, Kötzing, Timo, Lehre, Per Kristian, Wagner, Markus, Winzen, Carola
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of \leadingones drops from $\Theta(n^
Externí odkaz:
http://arxiv.org/abs/1012.0952
Drift analysis has become a powerful tool to prove bounds on the runtime of randomized search heuristics. It allows, for example, fairly simple proofs for the classical problem how the (1+1) Evolutionary Algorithm (EA) optimizes an arbitrary pseudo-B
Externí odkaz:
http://arxiv.org/abs/1011.3466
Suppose that $n$ drivers each choose a preferred parking space in a linear car park with $m$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with larger number (if any). If all
Externí odkaz:
http://arxiv.org/abs/0803.0302
Publikováno v:
In Theoretical Computer Science 3 February 2013 471:12-26
Publikováno v:
In Theoretical Computer Science 8 June 2012 436:71-86