Sciweavers

1171 search results - page 40 / 235
» Variable neighborhood search
Sort
View
80
Voted
CSR
2010
Springer
15 years 2 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
81
Voted
IUI
2005
ACM
15 years 3 months ago
Context-based similar words detection and its application in specialized search engines
This paper presents a new context-based method for automatic detection and extraction of similar and related words from texts. Finding similar words is a very important task for m...
Hisham Al-Mubaid, Ping Chen
EVOW
2010
Springer
15 years 4 months ago
Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems
Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This...
Botond Draskoczy
HICSS
2005
IEEE
131views Biometrics» more  HICSS 2005»
15 years 3 months ago
Train Traffic Deviation Handling Using Tabu Search and Simulated Annealing
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...
Johanna Törnquist, Jan A. Persson
CP
2001
Springer
15 years 2 months ago
Solving Non-binary CSPs Using the Hidden Variable Encoding
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
Nikos Mamoulis, Kostas Stergiou