Sciweavers

4759 search results - page 71 / 952
» Parallelizing the Phylogeny Problem
Sort
View
PAAPP
1998
149views more  PAAPP 1998»
13 years 7 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 8 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
14 years 1 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
BCB
2010
156views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
13 years 9 months ago
Empirical investigations on parallel competent genetic algorithms
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama