Sciweavers

4110 search results - page 19 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
150
Voted
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 3 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 7 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
120
Voted
ICWS
2008
IEEE
15 years 5 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
127
Voted
TCBB
2008
113views more  TCBB 2008»
15 years 3 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause