2109 search results - page 10 / 422 » Solving Necklace Constraint Problems |
GECCO
1999
Springer
14 years 3 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...
CIRA
2007
IEEE
14 years 5 months ago
2007
IEEE
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
GECCO
2003
Springer
14 years 4 months ago
2003
Springer
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
CEEMAS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Distributed Constraint Satisfaction Problems (DCSP) is a general framework for multi-agent coordination and conflict resolution. In most DCSP algorithms, inter-agent com...
ICTAI
2008
IEEE
2008
IEEE
Extending to Soft and Preference Constraints a Framework for Solving Efficiently Structured Problems
14 years 5 months ago
