We propose a decision-analytical approach to comparing the flexibility of decision situations from the perspective of a decisionmaker who exhibits constant risk-aversion over a mo...
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
Eduard Serradell, Przemyslaw Glowacki, Jan Kybic, ...
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
We consider the stochastic variant of the Canadian Traveler's Problem, a path planning problem where adverse weather can cause some roads to be untraversable. The agent does ...