The Multi-UAV Cooperative Mission Planning Problem (MCMPP) is a complex problem which can be represented with a lower or higher level of complexity. In this paper we present a MCMPP which is modelled as a Constraint Satisfaction Problem (CSP) with 5 increasing levels of complexity. Each level adds additional variables and constraints to the problem. Using previous models, we solve the problem u...

State-of-the-art solvers for Constraint Satisfaction Problems (CSP), Mixed Integer Programs (MIP), and satisfiability problems (SAT) are usually based on a branch-and-bound algorithm. The question how to split a problem into subproblems (branching) is in the core of any branch-and-bound algorithm. Branching on individual variables is very common in CSP, MIP, and SAT. The rules, however, which v...

Formulation of many real-life problems evolves when the problem is being solved. For example, a change in the environment might appear after the initial problem specification and this change must be reflected in the solution. Such changes complicate usage of a traditionally static constraint satisfaction technology that requires the problem to be fully specified before the solving process start...

We present the complete S-matrix of the O(2N) Gross-Neveu model including kinks, elementary fermions, and higher bound states. In addition to the S-matrix factorization, unitarity, and crossing conditions we make essential use of constraints which follow from the fact that particles in the spectrum are bound states of each other. A consistent solution can only be obtained if the kinks obey gene...

Constraint “at most one” is a basic cardinality constraint which requires that at most one of its n boolean inputs is set to 1. This constraint is widely used when translating a problem into a conjunctive normal form (CNF) and we investigate its CNF encodings suitable for this purpose. An encoding differs from a CNF representation of a function in that it can use auxiliary variables. We are esp...

The Upper Confidence Bounds (UCB) algorithm is a well-known near-optimal strategy for the stochastic multi-armed bandit problem. Its extensions to trees, such as Tree (UCT) algorithm, have resulted in good solutions problem of Go. This paper introduces DUCT, distributed inspired by UCT, solving Distributed Constraint Optimization Problems (DCOP). on solution quality are provided, and experiment...

Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate modelling or international stock market analysis often have only one end-to-end upper bound constraint. This is not sufficient to control overall temporal correctness as we may not find temporal violations until the la...

We study games with reachability objectives under energy constraints. first prove that strict constraints (either only lower-bound constraint or interval constraint), those are LOGSPACE -equivalent to the same but without objective (i.e., for infinite runs). then consider two relaxations of upper-bound (while keeping strict): in one, called weak upper bound , is absorbing i.e., when reached, ex...

This paper introduces a mathematical model for bound consistency of the constraint AllDifferent. It allows us to compute the probability that the filtering algorithm effectively removes at least one value in the variable domains. A complete study of the bound consistency properties is then proposed. It identifies several behaviors depending on some macroscopic quantities related to the variable...

In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single ...