Sciweavers

12 search results - page 2 / 3
» Towards the decathlon challenge of search heuristics
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 3 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
ECAI
2008
Springer
13 years 6 months ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
13 years 10 months ago
Hybrid multiobjective genetic algorithm with a new adaptive local search process
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
Salem F. Adra, Ian Griffin, Peter J. Fleming
LION
2009
Springer
203views Optimization» more  LION 2009»
13 years 11 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 7 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh