For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
In this paper, we propose two indepentent solutions to resolve the problems of many different spelling variants and of lack of annotated corpus for training, which are two main di...
We present a new propagator achieving bound consistency for the INTER-DISTANCE constraint. This constraint ensures that, among a set of variables X1, . . . , Xn, the difference be...
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for many-objective problems. In a user-preference based algorithm a decis...
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...