Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Sentence compression holds promise for many applications ranging from summarisation to subtitle generation and subtitle generation. The task is typically performed on isolated sen...
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
We introduce a model for extractive meeting summarization based on the hypothesis that utterances convey bits of information, or concepts. Using keyphrases as concepts weighted by...