The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
This paper presents an efficient method of learning motion control for autonomous animated characters. The method uses a non parametric learning approach which identifies non line...
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
Recommendation systems have been studied actively since the 1990s. Generally, recommendation systems choose one or more candidates from a set of candidates through a filtering pro...