1264 search results - page 32 / 253 » The framework approach for constraint satisfaction |
123
click to vote
AI
1999
Springer
15 years 1 months 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...
121
click to vote
BMVC
2002
15 years 4 months ago
2002
A qualitative image description grammar with automatic image fitting and object modelling algorithms is presented. The grammar is based on assigning a square sub-region of an imag...
140
click to vote
AI
1999
Springer
15 years 1 months ago
1999
Springer
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...
135
click to vote
SIAMDM
2010
15 years 9 days ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
143
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...