Sciweavers

1171 search results - page 21 / 235
» Variable neighborhood search
Sort
View
PAMI
2006
156views more  PAMI 2006»
14 years 9 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
ICNC
2005
Springer
15 years 3 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
HEURISTICS
2007
139views more  HEURISTICS 2007»
14 years 9 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
CORR
2008
Springer
133views Education» more  CORR 2008»
14 years 9 months ago
Emergence of Spontaneous Order Through Neighborhood Formation in Peer-to-Peer Recommender Systems
The advent of the Semantic Web necessitates paradigm shifts away from centralized client/server architectures towards decentralization and peer-to-peer computation, making the exi...
Ernesto Diaz-Aviles, Lars Schmidt-Thieme, Cai-Nico...
MST
2010
81views more  MST 2010»
14 years 8 months ago
Quantum Search with Variable Times
Since Grover’s seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection of n items x1, . . . , xn and we would like
Andris Ambainis