1007 search results - page 145 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
135
click to vote
ANOR
2010
14 years 12 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
144
click to vote
INTENSIVE
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G8...
115
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
120
click to vote
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
128
click to vote
CIA
2006
Springer
15 years 6 months ago
2006
Springer
We present a hybrid algorithm for distributed task allocation problem in a cooperative logistics domain. Our approach aims to achieve superior computational performance by combinin...