Sciweavers

1983 search results - page 90 / 397
» Competitive graph searches
Sort
View
CVPR
2010
IEEE
13 years 6 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
CP
1998
Springer
14 years 2 days ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
CLEF
2010
Springer
13 years 9 months ago
Applying the KISS Principle for the CLEF- IP 2010 Prior Art Candidate Patent Search Task
We present our experiments and results for the DCU CNGL participation in the CLEF-IP 2010 Candidate Patent Search Task. Our work applied standard information retrieval (IR) techniq...
Walid Magdy, Gareth J. F. Jones
MEMETIC
2010
311views more  MEMETIC 2010»
13 years 2 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
CEC
2005
IEEE
13 years 9 months ago
Rank and proximity based crossover (RPC) to improve convergence in genetic search
A new crossover technique, we named Rank and Proximity Based Crossover (RPC), to improve the speed and quality of solutions in Genetic search, is proposed. In the proposed strategy...
Goutam Chakraborty, Basabi Chakraborty