3533 search results - page 328 / 707 » Locally Optimized RANSAC |
148
Voted
CEC
2005
IEEE
16 years 12 days ago
2005
IEEE
Abstract- Finding Golomb rulers is an extremely challenging optimization problem (with many practical applications) that has been approached by a variety of search methods in recen...
173
click to vote
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
158
click to vote
ICA3PP
2005
Springer
16 years 9 days ago
2005
Springer
In this paper we propose a new parallelization scheme for Simulated Annealing — Hierarchical Parallel SA (HPSA). This new scheme features coarse-granularity in parallelization, d...
325
click to vote
LCPC
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Data copy is an important compiler optimization which dynamically rearranges the layout of arrays by copying their elements into local buffers. Traditionally, array copy...
193
click to vote
WCRE
2002
IEEE
15 years 11 months ago
2002
IEEE
The application of spectral methods to the software clustering problem has the advantage of producing results that are within a known factor of the optimal solution. Heuristic sea...