405 search results - page 56 / 81 » On the Complexity of Global Constraint Satisfaction |
108
click to vote
CP
2010
Springer
14 years 9 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
LATIN
2010
Springer
14 years 9 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
COMPSAC
2008
IEEE
15 years 5 months ago
2008
IEEE
We discuss the suitability of service-oriented computing for the automotive domain. We present a formal high-level language in which complex automotive activities can be modelled ...
ICPR
2004
IEEE
16 years 4 days ago
2004
IEEE
This paper presents an algorithm for tracking the articulate hand motion in monocular video sequences. The task is challenging due to the high degrees of freedom involved in the h...
103
click to vote
PRICAI
2004
Springer
15 years 4 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...