272 search results - page 22 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
AIPS
2009
14 years 11 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
AAAI
2008
15 years 3 days ago
2008
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
SIAMDM
2010
14 years 8 months 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 ...
105
click to vote
CP
2007
Springer
15 years 4 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...
IROS
2009
IEEE
15 years 4 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...