3 search results - page 1 / 1 » Local Search Algorithms on Graphics Processing Units. A Case... |
115
Voted
EVOW
2010
Springer
15 years 5 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...
135
Voted
IPPS
2010
IEEE
15 years 12 days 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...
145
click to vote
ICDM
2010
IEEE
15 years 14 days 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 ...