Most studies investigating models and algorithms for distributed constraint optimization problems (DCOPs) assume that messages arrive instantaneously are never lost. Specifically, local search DCOP algorithms, have been designed as synchronous (i.e., they perform in iterations which each agent exchanges with all its neighbors), despite running asynchronous environments. This is true also an any...

We develop the embedded gradient vector field method, introduced in [8] and [9], for case of special unitary group $\mathcal{SU}(N)$ regarded as a constraint submanifold $\mathcal{U}(N)$. The optimization problem associated to trace fidelity cost function defined on that appears context quantum control landscapes is completely solved using method. prove $N\geq 5$, landscape not $\mathcal{SU}(N)...

due to the probabilistic nature and uncertainties of structural parameters, reliability-based optimization will enable engineers to account for the safety of the structures and allow for its decision making applicability. thus, reliability-based design will substitute deterministic rules of codes of practice. space structures are of those types that have an exceedingly high range of applicabili...

This paper presents the mechanical synthesis of a four-bar mechanism, its definition as a constrained optimization problem in presence of one dynamic constraint and its solution with a swarm intelligence algorithm based on the bacteria foraging process. The algorithm is adapted to solve the optimization problem by adding a suitable constraint-handling technique able to incorporate a selection c...

Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The original proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. The present paper demonstrates that this expected grow...

Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP) and a generic solver finds a solution without additional programming. However, in practice, the situation is more complicated because there usually exist several ways how to model the problem as a CSP, that is using ...

In this study, an effective method for reliabilitybased design optimization is proposed enhancing sequential optimization and reliability assessment (SORA) method by a family of methods of moving asymptotes (MMA) approximations. In SORA, reliability estimation and deterministic optimization are performed sequentially. And the sensitivity and function value of probabilistic constraint at the mos...