Sciweavers

Share
297 search results - page 1 / 60
» Comparing Two Stochastic Local Search Algorithms for Constra...
Sort
View
CSR
2010
Springer
10 years 9 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
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). ...
Uwe Schöning
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
10 years 8 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
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...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
CPAIOR
2007
Springer
10 years 10 months ago
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
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 ...
Sivan Sabato, Yehuda Naveh
CONSTRAINTS
2007
122views more  CONSTRAINTS 2007»
10 years 4 months ago
Stochastic Local Search Algorithms for Graph Set T -colouring and Frequency Assignment
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...
Marco Chiarandini, Thomas Stützle
AUSAI
2005
Springer
10 years 6 months ago
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
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...
Stuart Bain, John Thornton, Abdul Sattar
books