566 search results - page 49 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
106
click to vote
AI
1999
Springer
15 years 5 days ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
107
Voted
CP
2003
Springer
15 years 5 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
87
Voted
IROS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...
114
Voted
AAAI
1996
15 years 1 months ago
1996
Most model-based diagnosis systems, such as GDE and Sherlock, have concerned discrete, static systems such as logic circuits and use simple constraint propagation to detect incons...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....