1197 search results - page 28 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
PPSN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
The goal of this work is to recover human body configurations from static images. Without assuming a priori knowledge of scale, pose or appearance, this problem is extremely chall...
JFP
2008
13 years 7 months ago
2008
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
CPAIOR
2010
Springer
13 years 7 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
CP
2004
Springer
14 years 2 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...