Sciweavers

717 search results - page 49 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
94 views 136 votes 15 years 5 months ago  JAIR 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...
91 views 134 votes 15 years 10 months ago  AISC 2004»
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...
129 views 159 votes 15 years 6 months ago  AAAI 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...
90 views 140 votes 15 years 5 months ago  AI 2002»
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...
175 views 158 votes 15 years 7 months ago  FLAIRS 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...
79 views 136 votes 15 years 11 months ago  IRI 2006»
When a Constraint Satisfaction Problem (CSP) admits no solution, most current solvers express that the whole search space has been explored unsuccessfully but do not exhibit which...
68 views 129 votes 15 years 7 months ago  AAAI 2007»
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
117 views 120 votes 15 years 5 months ago  JCP 2008»
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
130 views 155 votes 15 years 10 months ago  ATAL 2005»
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
118 views 143 votes 15 years 7 months ago  ECAI 2008»
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...