297 search results - page 1 / 60 » Comparing Two Stochastic Local Search Algorithms for Constra... |
CSR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
GECCO
1999
Springer
13 years 8 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...
CPAIOR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
CONSTRAINTS
2007
13 years 4 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
AUSAI
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. Methods of adaptive constraint satisfaction have recently become of interest to overcome the limitations imposed on “black-box” search algorithms by the no free lunch...