405 search results - page 37 / 81 » On the Complexity of Global Constraint Satisfaction |
SARA
2009
Springer
15 years 5 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
104
click to vote
AI
2008
Springer
14 years 11 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
TCS
2008
14 years 11 months ago
2008
Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...
76
Voted
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...
101
click to vote
PRESENCE
2008
14 years 11 months ago
2008
Virtual humans are more and more used in VR applications but their animation is still a challenge, especially if complex tasks must be carried-out in interaction with the user. In...