4524 search results - page 86 / 905 » The Complexity of Global Constraints |
101
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
CP
2000
Springer
15 years 5 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
154
Voted
IJCAI
1989
15 years 1 months ago
1989
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
TOG
2002
15 years 7 days 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...
102
Voted
STACS
2010
Springer
15 years 7 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...