556 search results - page 44 / 112 » Fast parallel GPU-sorting using a hybrid algorithm |
118
click to vote
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
129
click to vote
GPEM
2002
15 years 1 months ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
116
click to vote
TCAD
2002
15 years 1 months ago
2002
With the advent of system-on-a-chip design, many application specific integrated circuits (ASICs) now require multiple design clocks that operate asynchronously to each other. This...
96
Voted
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents a seed-based algorithm for intensive DNA sequence comparison. The novelty comes from the way seeds are used to efficiently generate small ungapped alignments ...
122
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—Stream processing is widely used by today’s applications such as financial data analysis and disaster response. In distributed stream processing systems, machine fail...