Sciweavers

438 search results - page 15 / 88
» New Search Heuristics for Max-CSP
Sort
View
78
Voted
CAEPIA
2007
Springer
15 years 3 months ago
Heuristics for Planning with Action Costs
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
Emil Keyder, Hector Geffner
CP
2008
Springer
14 years 11 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
65
Voted
EOR
2006
57views more  EOR 2006»
14 years 9 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
60
Voted
EVOW
2005
Springer
15 years 3 months ago
Population Training Heuristics
This work describes a new way of employing problem-specific heuristics to improve evolutionary algorithms: the Population Training Heuristic (PTH). The PTH employs heuristics in ...
Alexandre César Muniz de Oliveira, Luiz Ant...
HEURISTICS
2008
153views more  HEURISTICS 2008»
14 years 9 months ago
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
Jakob Puchinger, Günther R. Raidl