192 search results - page 2 / 39 » Comparing two approaches to dynamic, distributed constraint ... |
FLAIRS
2004
13 years 6 months ago
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...
AUSAI
2003
Springer
13 years 10 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
ISQED
2005
IEEE
13 years 10 months ago
2005
IEEE
Layout migration has re-emerged as an important task due to the increasing use of library hard intellectual properties. While recent advances of migration tools have accommodated ...
GECCO
1999
Springer
13 years 9 months ago
1999
Springer
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
PRICAI
1998
Springer
13 years 9 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...