staff job satisfaction is very important for assessments leading to organizational devel-opment. job satisfaction is a general attitude of workers towards with their job and it de-pends on the sum of all factors in organizational relations. the correlates of organiza-tional leadership style such as process of leadership, motivating factors, communication, process of decision making, and charact...

conclusions the findings of the study indicated a high satisfaction of the elderly with their hearing aids, considering the type of hearing loss. despite all the efforts to improve the audiologic services during verification process, the elderly should be consulted specifically in order to fit their hearing aid as well as their expectations from aid. results the mean satisfaction scores of the ...

Not all NP-complete problems share the same practical hardness with respect to exact computation. Whereas some NP-complete problems are amenable to efficient computational methods, others are yet to show any such sign. It becomes a major challenge to develop a theoretical framework that is more fine-grained than the theory of NP-completeness, and that can explain the distinction between the exa...

Constraint satisfaction is a fundamental Artificial Intelligence technique for knowledge representation and inference. However, the formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Fuzzy constraint satisfaction provides a more graded viewpoint. Priorities and preferences are placed on individual constrai...

When solving Distributed Constraint Satisfaction Problems (DCSP), it is desirable that the search exploits asynchronism as much as possible so that the employed agents can perform much of the work in parallel to utilize the processing power available in a distributed environment. However, in many of todays DCSP algorithms only a few agents are working at any given time and the others are idling...

In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational numbers or infinity, and is chosen from a fixed finite set of functions called a constraint language. The case when all functions take only values 0 and inf...

Constraint satisfaction problems constitute a broad class of algorithmic problems that are ubiquitous in several differ­ ent areas of artificial intelligence and computer science. In their full generality, constraint satisfaction problems are NP-complete and, thus, presumed to be algorithmically in­ tractable. To cope with the intractability of these prob­ lems, researchers have devoted conside...

The weighted constraint satisfaction problem (WCSP) framework is a soft constraint framework which can model many real life optimization or overconstrained problems. While there are many local consistency notions available to speed up WCSP solving, in this paper, we investigate how to effectively combine and channel mutually redundant WCSP models to increase constraint propagation. This success...

Constraint satisfaction problems (CSPs) are NP-complete in general, therefore it is important to identify tractable subclasses. A possible way to find such subclasses is to associate a hypergraph to the problem and impose restrictions on its structure. In this thesis we follow this direction. Among such structural properties, particularly important is acyclicity: it is well known that CSPs whos...