On A Class of Constrained Synchronization Problems in NP

The aim of this work is to study an optimal control problem with state con- straints where the state is given by an age-structured, abstract parabolic differential equa- tion.. We

Furthermore, as the OP algorithm applies to discrete-time optimal control problems, we give here an estimate of the error between the continuous time optimal control problem and

In such framework agents will be able to discover critical changes in MAS configuration (faults of agents, misbehavior, etc), negotiate responsibilities and change the

Moreover, cyclic scheduling can be found in mass production, such as cyclic shop or Hoist scheduling problems[6].. In cyclic scheduling often the notion of optimality is related to

Firstly, the temporal relations are designed to specify relations between multimedia objects of both deterministic and non-deterministic duration. Secondly, the

The degree- constrained minimum spanning tree problem is not polynomially approximable within a con- stant factor ρ: for all ρ ≥ 1, there is no polynomial time ρ-approximation

Moreover, for semantics with constrained reconfigurations that are equivalent to the unconstrained one as far as the coverability and synchronization problems are concerned, it would

We propose a (double) penalization approach for solving the bilevel optimization problem, with a different treatment of the two constraints: a basic penalization of the easy