400 search results - page 34 / 80 » A Synthesis of Constraint Satisfaction and Constraint Solvin... |
AIMSA
2008
Springer
13 years 9 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....
IWSAS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Self-adaptive systems must recon gure themselves, at runtime, to compensate for changing environments, objectives, and system capabilities. This paper discusses how the S...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
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...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
ANTSW
2008
Springer
13 years 9 months ago
2008
Springer
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP ...