Sciweavers

1171 search results - page 75 / 235
» Variable neighborhood search
Sort
View
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 1 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
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...
Martin Gruber, Jano I. van Hemert, Günther R....
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
14 years 9 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
JSAT
2010
132views more  JSAT 2010»
14 years 4 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
JDWM
2007
122views more  JDWM 2007»
14 years 9 months ago
A Hyper-Heuristic for Descriptive Rule Induction
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
Tho Hoan Pham, Tu Bao Ho
LAWEB
2006
IEEE
15 years 3 months ago
Analysis of Web Search Engine Clicked Documents
In this paper we process and analyze web search engine query and click data from the perspective of the documents (URL’s) selected. We initially define possible document categor...
David F. Nettleton, Liliana Calderón-Benavi...