Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
Miguel A. Salido, Montserrat Abril, Federico Barbe...
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...