Sciweavers

717 search results - page 8 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
126 views 111 votes 15 years 3 months ago  FLAIRS 2007»
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
132 views 99 votes 15 years 6 months ago  CCS 2001»
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
146 views 102 votes 15 years 6 months ago  ECAI 2004»
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
127 views 114 votes 15 years 6 months ago  AI 2003»
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
120 views 110 votes 15 years 7 months ago  SARA 2007»
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
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 104 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...