In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
The aim of the paper is to provide a theoretical basis for approximate reduced SQP methods. In contrast to inexact reduced SQP methods, the forward and the adjoint problem accuraci...
Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gh...
This paper describes an algorithm for exact decoding of phrase-based translation models, based on Lagrangian relaxation. The method recovers exact solutions, with certificates of...
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...