We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...
J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, ...
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...