This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...
Philip A. Bernstein, Todd J. Green, Sergey Melnik,...
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
We consider large scale interconnected systems where some of the interconnections are characterized by uncertain bounded delays. The delays may for instance be due to a communicati...