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...
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...