Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
We analyze volume flexibility — the ability to produce above/below the installed capacity for a product — under endogenous pricing in a two-product setting. We discover that ...
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, ...
— We present a framework for the programming of manipulation behavior by means of an intrinsic reward function that encourages the building of deep control knowledge. We show how...