314 search results - page 28 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
227
Voted
TASE
2010
IEEE
15 years 26 days ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
175
Voted
ICCS
2001
Springer
15 years 10 months ago
2001
Springer
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
151
Voted
AIPS
2009
15 years 7 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...
172
click to vote
FLAIRS
2008
15 years 8 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
166
click to vote
CISSE
2008
Springer
15 years 8 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...