The existing complete methods for solving Constraint Satisfaction Problems (CSPs) are usually based on a combination of exhaustive search and constraint propagation techniques for the reduction of the search space. Such propagation techniques are the local consistency algorithms. Arc Consistency (AC) and Generalized Arc Consistency (GAC) are the most widely studied local consistencies that are ...

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...

A geometric constraint solving method is presented that takes well-constrained mating conditions between a base and a mating component and directly transforms them into a 4 × 4 matrix that determines the relative orientation and location of the mating component with respect to the base component. In the proposed procedure, the 4 × 4 transformation matrix is determined by directly computing a ro...

In this paper, the authors present a new methodology to study the viscoelastic behaviour of the human finger. The methodology is based on experimental research consisting of a finger's indentation with a small steel cylindrical object for various indentation speeds. The tests were realized on a CETR UMT-2 Tribometer for indentation speed between 0.02 mm/s and 4 mm/s with a normal load of up to ...