2 papers
math.OC2014
Dynamic programming using radial basis functions
Oliver Junge, Alex Schreiber
We propose a discretization of the optimality principle in dynamic programming based on radial basis functions and Shepard's moving least squares approximation method. We prove con…
math.PR2012
The probability of finding a fixed pattern in random data depends monotonically on the bifix indicator
Alex Schreiber
We consider the problem of finding a fixed L-ary sequence in a stream of random L-ary data. It is known that the expected search time is a strictly increasing function of the lengt…