Structured constraints in Machine Learning have recently brought the Frank-Wolfe (FW) family of algorithms back into the spotlight. While the classical FW algorithm has poor local convergence properties, Away-steps FW and Pairwise FW have emerged as improv ...
We present an efficient, modular, and feature-rich framework for automated generation and validation of complex structures, suitable for tasks that explore a large space of structured values. Our framework is capable of exhaustive, incremental, parallel, a ...
We propose a new system-level abstraction, the lightweight immutable execution snapshot, which combines the immutable characteristics of checkpoints with the direct integration into the virtual memory subsystem of standard mutable address spaces. The abstr ...
This paper deals with compatible component selection problems, where the goal is to find combinations of components satisfying design constraints given a product structure, component alternatives available in design catalogue for each subsystem of the prod ...
Multi-valued decision diagrams (MDDs) are a convenient approach to representing many kinds of constraints including table constraints, regular constraints, complex set and multiset constraints, as well as ad-hoc problem specific constraints. This paper int ...
This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonally to usual methods for solving qualitative constraint satisfaction problems. In partic ...
