65 search results - page 6 / 13 » Designing efficient sorting algorithms for manycore GPUs |
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
GECCO
2005
Springer
14 years 24 days ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
SI3D
1995
ACM
13 years 11 months ago
1995
ACM
Interactive graphics applications have long been challenging graphics system designers by demanding machines that can provide ever increasing polygon rendering performance. Anothe...
PPL
2010
13 years 2 months ago
2010
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...