1480 search results - page 177 / 296 » Ants can solve constraint satisfaction problems |
206
click to vote
PAMI
2008
15 years 6 months ago
2008
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
174
click to vote
APSCC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
228
click to vote
EMNLP
2006
15 years 8 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
187
click to vote
AAAI
2010
15 years 8 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
162
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...