Image priors based on products have been recognized to offer many advantages because they allow simultaneous enforcement of multiple constraints. However, they are inconvenient for...
Giannis K. Chantas, Nikolas P. Galatsanos, Aristid...
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
This contribution describes a general mixed-integer linear programming model based on a time-indexed formulation covering the relevant features required for the complete supply ch...
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Modular and flexible software components can be useful for reuse across a class of domain-specific applications or product lines. By varying the composition of components suited t...
M. Brian Blake, Kevin Cleary, Sohan Ranjan, Luis I...