Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...