• Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH 

  Thiessen, Maximilian; Quesada, Luis; Brown, Kenneth N. (Springer, 2020-09-19)

  The degree-constrained minimum spanning tree problem, which involves finding a minimum spanning tree of a given graph with upper bounds on the vertex degrees, has found multiple applications in several domains. In this ...
• Debiased offline evaluation of Active Learning in Recommender Systems 

  Carraro, Diego; Bridge, Derek (Association for the Advancement of Artificial Intelligence, 2020-05-08)

  Active Learning (AL) when applied to Recommender Systems (RSs) aims at proactively acquiring additional ratings data from the RS users in order to improve subsequent recommendation quality. AL strategies are typically ...
• Transition to eBuses with minimal timetable disruptions 

  Arbelaez, Alejandro; Climent, Laura (Association for the Advancement of Artificial Intelligence, 2020-09)

  The implementation of a sustainable and efficient electric transportation network requires addressing multiple concerns such as: limited driving range, battery charging/discharging times and avoiding battery damages. ...
• Cooperative parallel SAT local search with path relinking 

  Jarvis, Padraigh; Arbelaez, Alejandro (Springer Nature Switzerland AG, 2020-04-09)

  In this paper, we propose the use of path relinking to improve the performance of parallel portfolio-based local search solvers for the Boolean Satisfiability problem. In the portfolio-based framework several algorithms ...
• Debiased offline evaluation of recommender systems: A weighted-sampling approach 

  Carraro, Diego; Bridge, Derek (Association for Computing Machinery, 2020-03)

  Offline evaluation of recommender systems mostly relies on historical data, which is often biased by many confounders. In such data, user-item interactions are Missing Not At Random (MNAR). Measures of recommender system ...

View more