Sciweavers

5580 search results - page 898 / 1116
» Randomized priority algorithms
Sort
View
IOPADS
1997
152views more  IOPADS 1997»
15 years 3 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
112
Voted
BMCBI
2010
100views more  BMCBI 2010»
15 years 2 months ago
Scaffold filling, contig fusion and comparative gene order inference
Background: There has been a trend in increasing the phylogenetic scope of genome sequencing without finishing the sequence of the genome. Increasing numbers of genomes are being ...
Adriana Muñoz, Chunfang Zheng, Qian Zhu, Vi...
137
Voted
BMCBI
2008
153views more  BMCBI 2008»
15 years 2 months ago
Estimating the size of the solution space of metabolic networks
Background: Cellular metabolism is one of the most investigated system of biological interactions. While the topological nature of individual reactions and pathways in the network...
Alfredo Braunstein, Roberto Mulet, Andrea Pagnani
IM
2007
15 years 2 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 2 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...