#### Filter Results:

#### Publication Year

2005

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Michael Gnewuch, Henryk Wozniakowski
- J. Complexity
- 2011

Tractability of multivariate problems has become nowadays a popular research subject. Polynomial tractability means that the solution of a d-variate problem can be solved to within ε with polynomial cost in ε −1 and d. Unfortunately, many multivariate problems are not polynomially tractable. This holds for all non-trivial unweighted linear tensor product… (More)

- Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann
- IEEE Congress on Evolutionary Computation
- 2007

—Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on this topic. In this paper we present a first rigorous runtime analysis on the effect of using neutrality. We consider a simple model where a layer of constant fitness is distributed in the… (More)

- Michael Gnewuch, Henryk Wozniakowski
- Foundations of Computational Mathematics
- 2009

We continue the study of generalized tractability initiated in our previous paper " Generalized tractability for multivariate problems, Part I: Linear tensor product problems and linear information " , J. Complexity, 23, 262-295 (2007). We study linear tensor product problems for which we can compute linear information which is given by arbitrary continuous… (More)

- Michael Gnewuch
- J. Complexity
- 2008

- Benjamin Doerr, Michael Gnewuch, Anand Srivastav
- J. Complexity
- 2005

For numerical integration in higher dimensions, bounds for the star-discrepancy with polynomial dependence on the dimension d are desirable. Furthermore , it is still a great challenge to give construction methods for low-discrepancy point sets. In this paper we give upper bounds for the star-discrepancy and its inverse for subsets of the d-dimensional unit… (More)

In memory of our friend, colleague and former fellow student Manfred Schocker Summary. We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on bracketing and on recent results on randomized roundings respecting hard constraints. It is structurally much simpler than the previous… (More)

- Benjamin Doerr, Michael Gnewuch, Peter Kritzer, Friedrich Pillichshammer
- Monte Carlo Meth. and Appl.
- 2008

We investigate the problem of constructing small point sets with low star discrepancy in the s-dimensional unit cube. The size of the point set shall always be polynomial in the dimension s. Our particular focus is on extending the dimension of a given low-discrepancy point set. This results in a deterministic algorithm that constructs N-point sets with… (More)

- Michael Gnewuch
- Electr. J. Comb.
- 2008

We construct explicit δ-bracketing covers with minimal cardinality for the set system of (anchored) rectangles in the two dimensional unit cube. More precisely, the cardinality of these δ-bracketing covers are bounded from above by δ −2 +o(δ −2). A lower bound for the cardinality of arbitrary δ-bracketing covers for d-dimensional anchored boxes from [M.… (More)

- Michael Gnewuch
- Math. Comput.
- 2012

We study the numerical integration problem for functions with infinitely many variables. The functions we want to integrate are from a reproducing kernel Hilbert space which is endowed with a weighted norm. We study the worst case ε-complexity which is defined as the minimal cost among all algorithms whose worst case error over the Hilbert space unit ball… (More)

- Michael Gnewuch
- Electr. J. Comb.
- 2005

The extreme or unanchored discrepancy is the geometric discrepancy of point sets in the d-dimensional unit cube with respect to the set system of axis-parallel boxes. For 2 ≤ p < ∞ we provide upper bounds for the average L p-extreme discrepancy. With these bounds we are able to derive upper bounds for the inverse of the L ∞-extreme discrepancy with optimal… (More)