Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
We consider a single-cell multiple-input multiple-output (MIMO) downlink channel where linear transmission and reception strategy is employed. The base station (BS) transmitter is...
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set ...