Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where cons...

this survey-study carried out among 360 randomly selected farmers living in drought-prone areas of fars province, iran, set out to investigate the perceptions and psychologi-cal coping strategies of farmers when facing drought. results showed that farmers per-ceived drought as a threat to all of their resources (material, conditions, personal, social and energies) and used emotion-focused and r...

Given that as much as half of human thought arises in a stimulus independent fashion, it would seem unlikely that such thoughts would play no functional role in our lives. However, evidence linking the mind-wandering state to performance decrement has led to the notion that mind-wandering primarily represents a form of cognitive failure. Based on previous work showing a prospective bias to mind...

Given a group of autonomous vehicles, an initial configuration, a final configuration, a set of interand intravehicle constraints, and a time for reconfiguration, the Formation Reconfiguration Planning problem is focused on determining a nominal input trajectory for each vehicle such that the group can start from the initial configuration and reach its final configuration at the specified time ...

Most of the research on aggregate production planning has been focused on discrete parts manufacturing models. In environments where intermediate inventory cannot be stored, and multiple products are produced simultaneously using complex con$gurations of production machines, these models may produce erroneous results. In this paper, we present a con$guration-based formulation for one such manuf...