The constraint satisfaction problem (CSP) deals with the assignment of values to variables according to existing constraints. Given n variables with their nite domains, the admissible combinations of values form a set of n-tuples which represents the globally consistent solution. This article presents a parallel approach to global constraint satisfaction. 0 Introduction The constraint satisfact...

The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP’13] have characterised a Galois connection between valued constraint languages and so-called weighted clones. In this paper, we study the structure of weighted clones. We extend the results of Creed and ...

Dynamic events in a multiagent environment can be a source of conflict. We model the network of inter-agent commitments as a constraint graph. Conflicts arise when an event prevents fulfillment of a commitment, resulting in an infeasible constraint graph. Constraint relaxation directed by a mediating agent is used to reconfigure the commitment graph. We investigate this general approach in the ...

An extension of the “Object Constraint Language” (OCL) for modeling real-time and reactive systems in the “Unified Modeling Language” (UML) is proposed, called OCL/RT. A general notion of events that may carry time stamps is introduced providing means to describe the detailed dynamic and timing behaviour of UML software models. OCL is enriched by satisfaction operators @η for referring to the v...

Cloud Computing is an attracting technology in the field of computer science. Cloud Computing involves sharing of resources. In the event of processing many jobs, the load balancing becomes essential for efficient operation and to improve user satisfaction. This paper introduces the strategic model that performs load balancing as well as dynamic partition of the nodes of different cloud. Differ...

Sports event research has displayed gaps in the analysis of different stakeholders’ perspectives and satisfaction levels. Consequently, this study aims at laying bare real-time experiences stakeholders via a unique mixed method approach for explaining stakeholder satisfaction. Data were gathered on occasion 2016 International Children’s Games Innsbruck, Austria mobile ethnography using an app (...

The traditional event tree analysis uses a single probability to represent each top event. However, it is unrealistic to evaluate the occurrence of each event by using a crisp value without considering the inherent uncertainty and imprecision a state has. The fuzzy set theory is universally applied to deal with this kind of phenomena. The main purpose of this study is to construct an easy metho...

Follow up what we will offer in this article about algorithms and ordering heuristics for distributed constraint satisfaction problems. You know really that this book is coming as the best seller book today. So, when you are really a good reader or you're fans of the author, it does will be funny if you don't have this book. It means that you have to get this book. For you who are starting to l...

I present a new approach towards temporal reasoning that generalizes from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems and includes interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. Moreover, I investigate how several factors underlying my gene...

Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably hold, but are not mandatory. In this paper, we model this problem as a valued constraint satisfaction problem (VCSP): costs are assigned to possible solutions based on the constraints they violate. We design an algorith...