Sciweavers

9849 search results - page 9 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
DAGSTUHL
2000
14 years 11 months ago
Presenting Data from Experiments in Algorithmics
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
Peter Sanders
BMCBI
2006
128views more  BMCBI 2006»
14 years 9 months ago
Rank-statistics based enrichment-site prediction algorithm developed for chromatin immunoprecipitation on chip experiments
Background: High density oligonucleotide tiling arrays are an effective and powerful platform for conducting unbiased genome-wide studies. The ab initio probe selection method emp...
Srinka Ghosh, Heather A. Hirsch, Edward A. Sekinge...
ICCS
2009
Springer
15 years 4 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
AMC
2004
79views more  AMC 2004»
14 years 9 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
15 years 4 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
Chris Whidden, Robert G. Beiko, Norbert Zeh