This paper presents a new method for editing an existing motion to satisfy a set of user-specified constraints, and in doing so guaranteeing the kinematic and dynamic soundness o...
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...