714 search results - page 19 / 143 » Lexicographically-ordered constraint satisfaction problems |
GECCO
2003
Springer
15 years 2 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...
88
Voted
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
GECCO
1999
Springer
15 years 1 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...
AAAI
1998
14 years 10 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— The dynamic composition of systems of networked appliances, or virtual devices, enables users to generate complex strong specific systems. Current prominent MANET-based composi...