— This work considers the problem of transmitting multiple compressible sources over a network with minimum cost. The problem is complicated by the fact that the description of t...
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
Roman van der Krogt, Jacob Feldman, James Little, ...
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...