1197 search results - page 42 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CVPR
1997
IEEE
14 years 1 months ago
1997
IEEE
In this paper, we consider a multi-camera vision system mounted on a moving object in a static threedimensional environment. By using the motion ow elds seen by all of the cameras...
KR
2004
Springer
14 years 2 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
CP
2007
Springer
14 years 3 months ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
CP
1997
Springer
14 years 1 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
TAPIA
2003
ACM
14 years 2 months ago
2003
ACM
We present a method for simulating rigid multibody dynamics with joints, contact, and friction. In this work, the nonsmooth contact and frictional constraints are represented by h...