Name
Abstract | ||
|---|---|---|
Arc-consistency caught many researchs' attention, involving the discovery of a large number of algorithms in the Constraint Satisfaction Problems (CSP) literature. These algorithms can be applied within or before the search of solutions, in order to eliminate inconsistencies and consequently to prune the search space. In this paper, we adopt a distributed approach due to the omnipresence of naturally distributed CSP real applications. So, a new distributed arc-consistency approach is proposed, discussed and illustrated through an example. Correctness, termination properties, complexity computing as well as experimental results are also given. |
Year | Venue | Keywords |
|---|---|---|
2002 | PRICAI | termination property,constraint satisfaction problems,complexity computing,search space,large number,csp real application,arc-consistency approach,constraint satisfaction problem,arc consistency,multi agent system |
Field | DocType | ISBN |
Constraint satisfaction,Local consistency,Computer science,Correctness,Multi-agent system,Constraint satisfaction problem,Distributed algorithm,Artificial intelligence,Reinforcement,Machine learning,Computational complexity theory | Conference | 3-540-44038-0 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahlem Ben Hassine | 1 | 129 | 9.04 |
| Khaled Ghedira | 2 | 108 | 21.93 |