23 search results - page 2 / 5 » Synthesising Textures Using Variable Neighbourhood Searching |
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
CP
2004
Springer
13 years 8 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
FUZZY
2001
Springer
13 years 9 months ago
2001
Springer
Simulated annealing is a general optimisation algorithm, based on hill-climbing. As in hill-climbing, new candidate solutions are selected from the ‘neighbourhood’ of the curre...
EVOW
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...