Sciweavers

8125 search results - page 420 / 1625
» Parallelism and evolutionary algorithms
Sort
View
IPPS
2008
IEEE
15 years 11 months ago
SWAMP: Smith-Waterman using associative massive parallelism
One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results s...
Shannon Steinfadt, Johnnie W. Baker
131
Voted
ISCAS
2003
IEEE
96views Hardware» more  ISCAS 2003»
15 years 10 months ago
High-speed VLSI architecture for parallel Reed-Solomon decoder
—This paper presents high-speed parallel Reed–Solomon (RS) (255,239) decoder architecture using modified Euclidean algorithm for the high-speed multigigabit-per-second fiber op...
Hanho Lee
HCW
2000
IEEE
15 years 9 months ago
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
Kenjiro Taura, Andrew A. Chien
148
Voted
PDPTA
2000
15 years 6 months ago
Using a Hypercube Algorithm for Broadcasting in Internet-Based Clusters
Internet-based clusters of workstations have been extensively used to execute parallel applications. Although these internet-based clusters seem to be an easy and inexpensive way ...
Silvia M. Figueira
IPPS
2000
IEEE
15 years 9 months ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar