4759 search results - page 399 / 952 » Parallelizing the Phylogeny Problem |
195
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
177
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
220
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
209
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
Modern embedded systems often require high degrees of instruction-level parallelism (ILP) within strict constraints on power consumption and chip cost. Unfortunately, a high-perfo...
196
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...