Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
ct 8 Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where 9 musicians improvise their instruments' pitches searching...