942 search results - page 63 / 189 » Distance Constraint Satisfaction Problems |
101
Voted
ECP
1997
Springer
15 years 5 months ago
1997
Springer
This paper concerns the problem of resource reasoning in planning. It defines formally a constraint satisfaction problem, the Time and Resource Problem (T RP), in which resource r...
92
Voted
AI
2005
Springer
15 years 21 days ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
78
Voted
ICRA
2003
IEEE
15 years 6 months ago
2003
IEEE
— Given a set of affine varieties in ℜ3, i.e. planes, lines, and points, the problem tackled in this paper is that of finding all possible configurations for these varieties...
118
Voted
CP
2005
Springer
15 years 2 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
101
Voted
AIPS
2009
15 years 1 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...