The success of constraint programming on scheduling problems comes from the low
complexity and power of propagators. The data structure Profile recently
introduced by Gingras and Quimper in Generalizing the edge-finder rule for the
cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, when
applied to the edge-finder rule for the cumulative resource constraint (which we
call horiz... hiện toàn bộ
Irene Daskalopoulou, Athanasia Karakitsiou, Christina Malliou
AbstractSustainable societies require that a diverse set of risks (e.g.
socio-economic, environmental, political and cultural) that intervene with
peoples’ wellbeing levels are systematically addressed. Here we focus on life
satisfaction and the social cohesion effects driven from the perceptions of
others in contemporary societies. We postulate that perceptions of risk as drawn
from ‘otherness’ a... hiện toàn bộ
M. Blokland, Rob van der Mei, Jeroen Pruyn, Jan Berkhout
AbstractPiping systems are common in many architectures and designing such
systems is often a complex task. Design automation of piping systems is
therefore a universal research subject. Nonetheless, these piping systems are
often still designed by hand as a result of their complexity. Consequently,
costs associated with piping design are high, especially for large-scale
architectures like ships a... hiện toàn bộ
AbstractWe consider the problem of allocating divisible/indivisible goods to
agents according to agents’ ordinal preferences. Hashimoto et al. [15] provided
a nonalgorithmic and axiomatic characterization of well-studied probabilistic
serial (PS) mechanism. Recently, Fujishige et al. [12] generalized the PS
mechanism where goods are enlarged from a fixed set to a family of sets which is
a polytope... hiện toàn bộ