1197 search results - page 53 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
TSP
2010
13 years 4 months ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
SMA
2005
ACM
14 years 2 months ago
2005
ACM
Geometric constraints are at the heart of parametric and feature-based CAD systems. Changing values of geometric constraint parameters is one of the most common operations in such...
EVOW
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
ICCV
2003
IEEE
14 years 11 months ago
2003
IEEE
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...