We cast the word alignment problem as maximizing a submodular function under matroid constraints. Our framework is able to express complex interactions between alignment component...
The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness o...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
The problem of minimally modifying a plan in response to changes in the specification of the planning problem has already been investigated in the literature. In this paper we cons...