2109 search results - page 1 / 422 » Solving Necklace Constraint Problems |
ECAI
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here ali...
ANOR
2011
13 years 5 months ago
2011
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
CONSTRAINTS
2010
13 years 8 months ago
2010
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...