2109 search results - page 88 / 422 » Solving Necklace Constraint Problems |
144
Voted
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...
134
Voted
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
- The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM...
162
click to vote
CP
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
139
click to vote
CVPR
2009
IEEE
17 years 1 days ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
145
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...