output
20002026
most citedUsing Bad Learners to find Good Configurations

123 citations

Showing 2016Show all

18 papers · 1 filter

cs.LO2016★ 9 cited

A Light-Weight Approach for Verifying Multi-Threaded Programs with CPAchecker

Dirk Beyer, Karlheinz Friedberger

Verifying multi-threaded programs is becoming more and more important, because of the strong trend to increase the number of processing units per CPU socket. We introduce a new con…

math.OC2016

Non-conservative discrete-time ISS small-gain conditions for closed sets

Navid Noroozi, Roman Geiselhart, Lars Grüne +2

This paper presents a unification and a generalization of the small-gain theory subsuming a wide range of existing small-gain theorems. In particular, we introduce small-gain condi…

cs.CG2016

Numerically robust computation of circular visibility

Stephan Brummer, Georg Maier, Tomas Sauer

We address the question of whether a point inside a domain bounded by a simple closed arc spline is circularly visible from a specified arc from the boundary. We provide a simple a…

math.NA2016★ 1 cited

Reconstructing sparse exponential polynomials from samples: Stirling numbers and Hermite interpolation

Tomas Sauer

Prony's method, in its various concrete algorithmic realizations, is concerned with the reconstruction of a sparse exponential sum from integer samples. In several variables, the r…

math.NA2016

Observations on interpolation by total degree polynomials in two variables

Jesús Carnicer, Tomas Sauer

In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space d…

math.PR2016

On non-polynomial lower error bounds for adaptive strong approximation of SDEs

Larisa Yaroslavtseva

Recently, it has been shown in [Hairer, M., Hutzenthaler, M., Jentzen, A., Loss of regularity for Kolmogorov equations, Ann. Probab. 43, 2 (2015), 468--527] that there exists a sys…