This research investigated the relationships among pre-entry expectations, post-entry experiences and psychological contract violations. The goal was to clarify the conceptual distinctions between the constructs and to test their differential impact on job satisfaction. In a national longitudinal study, 235 final-year occupational therapy students were surveyed immediately prior to entering the...

In the goal of genetic improvement of livestock by marker assisted selection, we aim at reconstructing the haplotypes of sires from their offspring. We reformulated this problem into a binary weighted constraint satisfaction problem. Our results showed these problems have a small treewidth and can be solved optimally, improving haplotype reconstruction compared to previous approaches especially...

Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method forAdopt andDp...

This paper sets a model for Distributed Valued Constraint Satisfaction Problems, and proposes an incompletemethod for solving such problems. This method is a greedy repair distributed algorithm which extends to the distributed case any greedy repair centralized algorithm. Experiments are carried out on a real-world problem and show the practical interest of this method.

This article examines the interplay between school factors and teacher job satisfaction that influences educational outcomes by comparing two Non-governmental Organisation (NGO) schools in Cambodia. This small-scale qualitative case study was conducted over a period of eight weeks in 2005 in two NGO schools in a suburb of Phnom Penh. The findings show that teacher job satisfaction is crucially ...

We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in...

We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major structural CSP decomposition methods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory, and analyze the cost of solving CSPs having bounded hypertree-width. We provide a framework for compa...

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. A connection between these and tree decompositions is established. This enables us to almost seamlessly adapt the combinatorial and algorithmic results known for tre...

Both parametric design tasks and analysis tasks of technical systems have a similar problem setting: The structure of the system to be configured or analyzed is defined already. Within the parametric design task unknown values for component geometries have to be determined, while within the analysis task the system has to be completed with respect to missing physical quantities. The tasks menti...

We make use of the algebraic theory that has been used to study the complexity of constraint satisfaction problems, to investigate tractable quantified boolean formulas. We present a pair of results: the first is a new and simple algebraic proof of the tractability of quantified 2-satisfiability; the second is a purely algebraic characterization of models for quantified Horn formulas that were ...