1197 search results - page 55 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CP
2006
Springer
14 years 1 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
SMI
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
ENTCS
2007
13 years 8 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
CONSTRAINTS
2002
13 years 9 months ago
2002
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...