Search Results for author:
Found 5 papers, 1 papers with code
Evolving Assembly Code in an Adversarial Environment
In this work, we evolve assembly code for the CodeGuru competition.
Efficient One Sided Kolmogorov Approximation
We present an efficient algorithm that, given a discrete random variable $X$ and a number $m$, computes a random variable whose support is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal, also for the one-sided Kolmogorov approximation.
Composition of Dynamic Control Objectives Based on Differential Games
We present a divide and conquer design approach for handling control problems with dynamically changing objectives.
An optimal approximation of discrete random variables with respect to the Kolmogorov distance
We present an algorithm that takes a discrete random variable $X$ and a number $m$ and computes a random variable whose support (set of possible outcomes) is of size at most $m$ and whose Kolmogorov distance from $X$ is minimal.
Estimating the Probability of Meeting a Deadline in Hierarchical Plans
For the proposed approximation algorithm, we establish formal approximation bounds and show that the time and memory complexities grow polynomially with the required accuracy, the number of nodes in the plan, and with the size of the support of the random variables that represent the durations of the primitive tasks.
