717 search results - page 49 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
JAIR
2000
14 years 9 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
AAAI
2000
14 years 11 months ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
AI
2002
Springer
14 years 9 months ago
2002
Springer
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
FLAIRS
2008
15 years 4 days 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...