3 search results - page 1 / 1 » Local Search Algorithms on Graphics Processing Units. A Case... |
EVOW
2010
Springer
13 years 7 months ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...