Related papers: Combining Symmetry Breaking and Global Constraints
Safety constraints are crucial to the development of mission-critical systems. The practice of developing software for systems of this type requires reliable methods for identifying and analysing project artefacts. This paper proposes a…
A core challenge in program synthesis is taming the large space of possible programs. Since program synthesis is essentially a combinatorial search, the community has sought to leverage powerful combinatorial constraint solvers. Here,…
The jet bundle description of time-dependent mechanics is revisited. The constraint algorithm for singular Lagrangians is discussed and an exhaustive description of the constraint functions is given. By means of auxiliary connections we…
A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a…
We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…
Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…
In the constrained synchronization problem we ask if a given automaton admits a synchronizing word coming from a fixed regular constraint language. We show that intersecting a given constraint language with an ideal language decreases the…
We investigate a way of imposing simplicity constraints in a holomorphic Spin Foam model that we recently introduced. Rather than imposing the constraints on the boundary spin network, as is usually done, one can impose the constraints…
New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…
Symmetry in mathematical programming may lead to a multiplicity of solutions. In nonconvex optimisation, it can negatively affect the performance of the branch-and-bound algorithm. Symmetry may induce large search trees with multiple…
We exhibit three classes of algebraic constraints which are shown compatible with Volterra lattice.
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
The purpose of this paper is to investigate the generalized formulation of weighted optimal guidance laws with impact angle constraint. From the generalized formulation, we explicitly find the feasible set of weighting functions that lead…
Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are…
First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised…
We re-examine the constraints on continuous family symmetries coming from flavour changing neutral current limits on the D-term contributions to squark and slepton masses. We show that, for a restricted choice of the familon sector,…
This paper describes a new approach on optimization of constraint satisfaction problems (CSPs) by means of substituting sub-CSPs with locally consistent regular membership constraints. The purpose of this approach is to reduce the number of…
The way of finding all the constraints in the Hamiltonian formulation of singular (in particular, gauge) theories is called the Dirac procedure. The constraints are naturally classified according to the correspondig stages of this…