1381 search results - page 63 / 277 » Computational Complexity of Constraint Satisfaction |
117
Voted
TOG
2002
15 years 3 months ago
2002
In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Ou...
134
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
121
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
158
click to vote
AISC
2004
Springer
15 years 9 months ago
2004
Springer
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
119
click to vote
ISORC
2008
IEEE
15 years 10 months ago
2008
IEEE
The specific constraints that must be satisfied by embedded systems, such as timeliness, energy efficiency of battery-operated devices, dependable operation in safety-relevant sce...