1647 search results - page 37 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
107
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
142
click to vote
BMVC
2002
15 years 4 months ago
2002
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
117
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
172
click to vote
STOC
1998
ACM
15 years 6 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
116
Voted
WADS
2005
Springer
15 years 7 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....