We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
The performance of haptic application is highly sensitive to communication delays and losses of data. It implies several constraints in developing networked haptic applications. Th...
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
Materialized views are nowadays commonly used in the data warehouse environment. Materialized views need to be updated when data sources change. Since the update of the views may ...