1480 search results - page 175 / 296 » Ants can solve constraint satisfaction problems |
168
click to vote
AAECC
1999
Springer
15 years 6 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
194
click to vote
IJCV
2006
15 years 6 months ago
2006
We present an algebraic geometric approach to 3-D motion estimation and segmentation of multiple rigid-body motions from noise-free point correspondences in two perspective views. ...
255
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
153
click to vote
WCNC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—In this paper, we consider a robust design of MIMOrelay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO...
212
click to vote
CP
2005
Springer
16 years 2 days ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...