265 search results - page 11 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
HM
2007
Springer
14 years 9 days ago
2007
Springer
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
IJAIT
2007
13 years 8 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
HIPC
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we report a decentralized algorithm, termed ImmuneSearch, for searching p2p networks. ImmuneSearch avoids query message flooding; instead it uses an immune-systems-...
WABI
2004
Springer
14 years 1 months ago
2004
Springer
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...