Sciweavers

717 search results - page 9 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
146 views 128 votes 15 years 2 months ago  FLAIRS 2004»
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
121 views 151 votes 14 years 11 months ago  ICTAI 2009»
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
92 views 114 votes 15 years 1 months ago  AICOM 2004»
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
139 views 110 votes 15 years 2 months ago  AAAI 1997»
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
99 views 105 votes 15 years 2 months ago  IJCAI 1989»
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
119 views 107 votes 15 years 2 months ago  FLAIRS 2004»
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
129 views 102 votes 15 years 7 months ago  CP 2005»
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
127 views 151 votes 15 years 1 months ago  CONSTRAINTS 1998»
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
126 views 138 votes 15 years 1 months ago  CONSTRAINTS 2010»
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
119 views 115 votes 15 years 7 months ago  CEC 2007»
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...