The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
This paper proposes a simple approach to the affine motion interpolation problem, where an affine spline motion is generated that interpolates a given sequence of affine keyframes...
Abstract. The problemof state abstractionis of centralimportancein optimalcontrol,reinforcement learning and Markov decision processes. This paper studies the case of variable reso...
We propose a novel algorithm for sentiment summarization that takes account of informativeness and readability, simultaneously. Our algorithm generates a summary by selecting and ...
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...