• A comparison of calibrated and intent-aware recommendations 

  Kaya, Mesut; Bridge, Derek (Association for Computing Machinery (ACM), 2019-09)

  Calibrated and intent-aware recommendation are recent approaches to recommendation that have apparent similarities. Both try, to a certain extent, to cover the user's interests, as revealed by her user profile. In this ...
• Balancing schedules using maximum leximin 

  Toffano, Federico; Wilson, Nic (Springer, 2019-09-04)

  We consider the problem of assigning, in a fair way, time limits for processes in manufacturing a product, subject to a deadline where the duration of each activity can be uncertain. We focus on an approach based on choosing ...
• Analytics-based decomposition of a class of bilevel problems 

  Fajemisin, Adejuyigbe; Climent, Laura; Prestwich, Steven D. (Springer Nature Switzerland AG, 2019-06-15)

  This paper proposes a new class of multi-follower bilevel problems. In this class the followers may be nonlinear, do not share constraints or variables, and are at most weakly constrained. This allows the leader variables ...
• Modelling Dynamic Programming-based global constraints in Constraint Programming 

  Visentin, Andrea; Prestwich, Steven D.; Rossi, Roberto; Tarim, Armagan (Springer Nature Switzerland AG, 2019-06-15)

  Dynamic Programming (DP) can solve many complex problems in polynomial or pseudo-polynomial time, and it is widely used in Constraint Programming (CP) to implement powerful global constraints. Implementing such constraints ...
• Relating the structure of a problem and its explanation 

  Freuder, Eugene C. (Association for the Advancement of Artificial Intelligence (AAAI), 2019-01)

  As AI becomes more ubiquitous there is increasing interest in computers being able to provide explanations for their conclusions. This paper proposes exploring the relationship between the structure of a problem and its ...

View more