1197 search results - page 21 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ICTAI
2009
IEEE
13 years 6 months ago
2009
IEEE
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...
AIMSA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
AICCSA
2006
IEEE
14 years 3 months ago
2006
IEEE
: The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the ...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
IJCAI
1993
13 years 10 months ago
1993
Whilst much emphasis in AI has been placed on the use of goals in problem solving, less emphasis has been placed on the role of perception and experience. In this paper we show th...