The geometric constraint enforcement using Lagrange Multipliers is one of the popular methods to control the behavior and trajectories of dynamically simulated entities. Therefore, effective and efficient enforcement and proper integration of the geometric constraints is the key to a successful constraint management. This paper describes the formulation and integration of geometric constraints ...

critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

We describe the constraint satisfaction problem and show that it unifies a very wide variety of computational problems. We discuss the techniques that have been used to analyse the complexity of different forms of constraint satisfaction problem, focusing on the algebraic approach, explaining the basic ideas and highlighting some of the recent results in this area. The above abstract belongs to...

This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P )). We show that if the set of assignments accepted by P contains the support of a balanced pairwise independent distribution over the domain of the inputs, then such a problem on n variables cannot be approximated better than the trivial (random) approximation, even using Ω(n) levels ...

In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...

Class Domain Main fields V: Variable variable associated with this domain Main methods abstract boolean isEmpty() returns true iff the domain is empty abstract List discretize() returns a discrete representation of the domain (a list of values) Domain clone() returns a copy of the Domain object abstract void setSingleValue(in val:Value) reduce domain to a single value Table 3. Domain cla...

This work can be considered a step to simplify the dynamic integrity constraint checking. We propose a method to transform a dynamic constraint to an equivalent past-directed form. This transformation will facilitate the constraint checking in temporal databases. The method proposed deals with integrity constraints defined by first-order logic formulas with explicit time in a denial form. It is...

In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequatly. We substantiate our proposition by an example. Then we present a new method to transform constraint hierarchies into equivalent ordinary constraint systems. For practial applications, we present a modiied algorithm based on an incomplete ni...