2109 search results - page 155 / 422 » Solving Necklace Constraint Problems |
208
click to vote
CONSTRAINTS
1998
15 years 5 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
144
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
112
click to vote
CGF
2000
15 years 6 months ago
2000
In this paper, we present a new method for solving the Motion Retargeting Problem, by using an intermediate skeleton. This allows us to convert movements between hierarchically an...
196
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...
346
click to vote
COSIT
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...