44 search results - page 4 / 9 » A memory-layout oriented run-time technique for locality opt... |
IPPS
2010
IEEE
13 years 4 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...
ICIP
2005
IEEE
14 years 8 months ago
2005
IEEE
This paper presents a new image coding technique based on oriented 1D multiscale decompositions on a quincunx sampling grid. A transform obtained by adapting the lifting steps of ...
PR
2006
13 years 6 months ago
2006
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
ROBOCUP
2004
Springer
13 years 11 months ago
2004
Springer
We show that all published visual data processing methods for the simulated robotic soccer so far were not utilizing all available information, because they were mainly based on he...
GECCO
2011
Springer
12 years 9 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...