Sciweavers

2303 search results - page 161 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
152
Voted
BMCBI
2010
153views more  BMCBI 2010»
15 years 3 months ago
Pash 3.0: A versatile software package for read mapping and integrative analysis of genomic and epigenomic variation using massi
Background: Massively parallel sequencing readouts of epigenomic assays are enabling integrative genome-wide analyses of genomic and epigenomic variation. Pash 3.0 performs sequen...
Cristian Coarfa, Fuli Yu, Christopher A. Miller, Z...
PPAM
2001
Springer
15 years 8 months ago
Estimating Execution Time of Distributed Applications
In this work we consider the problem of estimating execution time of distributed applications. The main difficulty stems from the communication delays and shared nature of the comp...
Maciej Drozdowski
130
Voted
PPSN
2010
Springer
15 years 1 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
123
Voted
CIKM
2007
Springer
15 years 9 months ago
High-performance distributed inverted files
We present a general method of parallel query processing that allows scalable performance on distributed inverted files. The method allows the realization of a hybrid that combin...
Mauricio Marín, Veronica Gil Costa
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 8 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...